Advanced
Data Structures & Algorithms
Q99 / 100
What is the integer sorting lower bound, and why can radix sort break O(n log n)?
Correct! Well done.
Incorrect.
The correct answer is B) The Ω(n log n) lower bound applies only to comparison-based sorts; radix sort exploits fixed-width integer structure to sort in O(n)
B
Correct Answer
The Ω(n log n) lower bound applies only to comparison-based sorts; radix sort exploits fixed-width integer structure to sort in O(n)
Explanation
The decision-tree lower bound applies only to comparison-based sorting. Radix sort, counting sort, and bucket sort are non-comparison algorithms exploiting integer key structure, achieving linear time.
Progress
99/100