Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What is the lower bound on worst-case time for any comparison-based sort?
A
Ω(log n)
B
Ω(n)
C
Ω(n log n)
D
Ω(n^2)