When sorting an array using randomized quicksort (pivot chosen randomly), what are its average-case and worst-case time complexities?

When sorting an array using randomized quicksort (pivot chosen randomly), what are its average-case and worst-case time complexities?

  1. a) O(n log n), O(n)
  2. b) O(n²), O(n log n)
  3. c) O(n log n), O(n²)
  4. d) O(log n), O(n log n)

From the Combined Bank Senior Officer October 2025 – Written exam, question 13 of 50.

More from this paper