Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What is the average time complexity of quickselect for the k-th smallest element?
A
O(k log n)
B
O(log n)
C
O(n log n) always
D
O(n) average, O(n^2) worst case (median-of-medians gives O(n) worst case)