Ask your own question, for FREE!
Computer Science 17 Online
OpenStudy (anonymous):

I'm trying to implement B+ trees using c. Can you suggest a way to read sorted data from file and store in a B+ tree in O(n) time. Normally it is accomplished in O(nlog(n)) time, is there a way to do it in linear time???

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!