Suppose we have a O time algorithm that finds median of an unsorted array. No...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Suppose we have a O time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.

d.

O(nLogn)

100%

b.

O(n Logn Logn)

0%

c.

O(n^2 Logn)

0%

a.

O(n^2)

0%

Want instant access to all verified answers on training.saveetha.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome