GATE | GATE CS 2019 | Question 31

An array of 25 distinct element is to be sorted using quicksort. Assume that the pivot element is choosen uniformly at random The probability that pivot element gets placed in the worst possible location in the first round of partitioning (round off to 2 decimal places) is
(A) 0.08

Answer: (A)


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.