If quicksort is written so that partition algorithm always uses the median value of the segment as the pivot then worst case performance of quick sort will be?
Explain This Please , What Should Be The Answer?
Hey @AnshBajpai
In such a case, worst case would occur if the input array is such that the maximum (or minimum) element is always chosen as pivot.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.