GATE | GATE CS 2019 | Question 32

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 Question
Please comment below if you find anything wrong in the above post

Article Tags :

GATE

Recommended Articles

1. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 15

2. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 16

3. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 17

4. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 18

5. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 19

6. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 20

7. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 21

8. GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 22

9. GATE | GATE CS 2019 | Question 40

10. GATE | GATE CS 2019 | Question 1

11. GATE | GATE CS 2019 | Question 2

12. GATE | GATE CS 2019 | Question 3

13. GATE | GATE CS 2019 | Question 4

14. GATE | GATE CS 2019 | Question 5

15. GATE | GATE CS 2019 | Question 6

16. GATE | GATE CS 2019 | Question 7

17. GATE | GATE CS 2019 | Question 8

18. GATE | GATE CS 2019 | Question 9

19. GATE | GATE CS 2019 | Question 9

20. GATE | GATE CS 2019 | Question 10

21. GATE | GATE CS 2019 | Question 11

22. GATE | GATE CS 2019 | Question 12

23. GATE | GATE CS 2019 | Question 13

24. GATE | GATE CS 2019 | Question 14

25. GATE | GATE CS 2019 | Question 15