next up previous
Next: Lower Bounds For Worst-Case Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Sorting in Linear Time

Comparison Sorts -- O(nlgn), $\Omega(nlgn)$ for some input

The best we can do for comparison sorts is $\Omega(nlgn)$.

Other techniques for sorting exist, such as Linear Sorting which is not based on comparisons. Linear Sorting techniques include:


Copyright © 1998 The University of Texas at Arlington