Given a set of n integers the worst case time complexity of quick sort is
2026
Given a set of n integers the worst case time complexity of quick sort is
Answer: C. θ(n²) — The worst-case time complexity of quick sort is O(n2), which occurs when the pivot selection consistently results in unbalanced partitions, such as always…
- A.
θ(n)
- B.
θ(n log n)
- C.
θ(n²)
- D.
θ(n² log n)
Attempted by 513 students.
Show answer & explanation
Correct answer: C
The worst-case time complexity of quick sort is O(n2), which occurs when the pivot selection consistently results in unbalanced partitions, such as always choosing the smallest or largest element.
Loading lesson…