next up previous
Next: Lower Bounds For Worst-Case Up: l4 Previous: l4

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:

*
Counting Sort
*
Radix Sort
*
Bucket Sort


next up previous
Next: Lower Bounds For Worst-Case Up: l4 Previous: l4