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

3 way of Merge sort Suppose that instead of dividing in half at each step of merge sort you divide into thirds, sort each third and finally combine all of them using a three way merge subroutine.What is the overall asymptotic running time of this algorithm ?? Hint note that the merge step can still be implemented in 0(n) 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!