GATE | GATE CS 2019 | Question 32 Last Updated : 13 Sep, 2021 Improve Improve Like Article Like Save Share Report An array of 25 distinct element is to be sorted using quicksort. Assume that the pivot element is chosen 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) Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above post Like Article Suggest improvement Previous GATE | GATE-CS-2009 | Question 5 Next GATE | GATE CS 2019 | Question 31 Share your thoughts in the comments Add Your Comment Please Login to comment...