Sorting Algorithms
Comparison based
compare-exchange
O(n log n)
Noncomparison based
Uses known properties of the elements
O(n) - bucket sort etc.
Previous slide
Next slide
Back to first slide
View graphic version