When physically sorting objects, such as alphabetizing papers ( such as tests or books ), people intuitively generally use insertion sorts for small sets.
42.
Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
43.
One implementation can be described as arranging the data sequence in a two-dimensional array and then sorting the columns of the array using insertion sort.
44.
When the list gets long, they tend to use a bucket sort to get it partially sorted and then an insertion sort on the shorter lists.
45.
Others could then sort those buckets, by using an insertion sort, and wouldn't need to wait until the first person finished his sorting.
46.
"' Insertion sort "'is a simple sorting algorithm that builds the final sorted array ( or list ) one item at a time.
47.
Musser also considered the effect on Sedgewick's delayed small sorting, where small ranges are sorted at the end in a single pass of insertion sort.
48.
Bubble sort is asymptotically equivalent in running time to insertion sort in the worst case, but the two algorithms differ greatly in the number of swaps necessary.
49.
On such a partially sorted array, insertion sort will run at most iterations of its inner loop, which is run times, so it has linear time complexity.
50.
However, this is more often an advantage for insertion sort in that it runs much more efficiently if the array is already sorted or " close to sorted ."
