Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 635
What makes counting sort and radix sort able to beat O(n log n)?
A
They don't compare elements; they exploit a bounded key range or digit structure
B
They use more CPUs
C
They only work on sorted input
D
They are O(n log n) in disguise