Modified Mergesort

Computer Science Level 3

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?

n\log _{ 2/3 }{ n }

n\log _{ 1/3 }{ n }

n\log _{ 3 }{ n }

n\log _{ 3/2 }{ n }

n\log _{ 2 }{ n }

0 solutions

No explanations have been posted yet. Check back later!

Modified Mergesort

0 solutions

0 pending reports