Advanced
Data Structures & Algorithms
Q89 / 100
What is the significance of the lower bound Ω(n log n) for comparison-based sorting?
Correct! Well done.
Incorrect.
The correct answer is B) Any comparison-based sort must make at least Ω(n log n) comparisons in the worst case — proven by decision tree argument
B
Correct Answer
Any comparison-based sort must make at least Ω(n log n) comparisons in the worst case — proven by decision tree argument
Explanation
A decision tree for n-element sorting has n! leaves. Its height is ≥ log₂(n!) = Θ(n log n) by Stirling's approximation, proving no comparison sort beats Ω(n log n).
Progress
89/100