Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 40
When does quicksort degrade to O(n^2)?
A
Never; it is always O(n log n)
B
When the input has many distinct values
C
When pivots repeatedly split the array very unevenly, e.g. always picking the first element of already sorted input
D
When the array fits in cache