Sorting with Small Insertion Indices

It is very common to apply sorting algorithms to lists with small insertion indices. Example?

Insertion sort is nice because it runs fast for lists with small insertion indices.


next up previous
Next: An Assortment of Sorts Up: INSERTION SORT Previous: Measures of Sortedness