Problem #37

Comparisons in Mergesort
Public 11/13/09 8xp Programming 37.0%

Mergesort is a recursive sorting algortihm defined as:
-Assume length of input(n) is a power of two
-If n=1, return the element
-If n>1, break list into two
-call mergesort on each half
-merge the sorted lists

How many comparisons are required(in worst case) to sort a list with 2^150 elements using mergesort?



You need to be a member to keep track of your progress.
Register


Time may end, but hope will last forever.

Other Challenge Sites

Contact

elasolova
[64][103][109][97][105][108][46][99][111][109]