ROSECODE 037
Comparisons in Mergesort
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?
-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?