MCQOPTIONS
Saved Bookmarks
| 1. |
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n number using randomized quicksort? |
| A. | O (n) |
| B. | O(n log n) |
| C. | O(n2) |
| D. | O(n!) |
| Answer» C. O(n2) | |