Modified Mergesort

Computer Science Level pending

Consider a modified version of the merge sort algorithm where the input array is split at a position one-third of the total length (\(n\)) of the list to be sorted. What is the worst cast time complexity of such an algorithm?

×

Problem Loading...

Note Loading...

Set Loading...