**Insertion sort** is a simple sort algorithm where the result is built up one entry at a time. It is much less efficient than the more advanced algorithms such as Quicksort or Mergesort but advantages are:

- Simple to implement
- Efficient on small data sets
- Efficient on data sets which are already substantially sorted
- Stable
- Does not suffer from poor 'worst case input' performance
- Meagre memory requirements

Sorting is done in-place. The result array after *k* iterations contains the first *k* entries of the input array and is sorted. In each step, the first remaining entry of the input is removed, inserted into the result at the right position, thus extending the result:

becomes:+------ result ------+------ input ------+ | <= x | > x | x | ... | +--------------------+-------------------+

with each element >+-------- result --------+---- input ----+ | <= x | x | > x | ... | +------------------------+---------------+

The algorithm can be described as:

- Start with the result being the first element of the input.
- Loop over the input until it is empty, "removing" the first remaining (leftmost) element.
- Compare the removed element against the current result, starting from the highest (rightmost) element, and working left towards the lowest element.
- If the removed input element is lower than the current result element, copy that value into the following element to make room for the new element below, and repeat with the next lowest result element.
- Otherwise, the new element is in the correct location; save it in the cell left by copying the last examined result up, and start again from (2) with the next input element.

def straightinsertionsort(array):for removed_index in range(1, len(array)): removed_value = array[removed_index] insert_index = removed_index while insert_index > 0 and array[insert_index - 1] > removed_value: array[insert_index] = array[insert_index - 1] insert_index = insert_index - 1 array[insert_index] = removed_value

One coding using a functional programming language such as Haskell might be:

> insert :: Ord a => a -> [a] -> [a] > insert item [] = [item] > insert item (h:t) | item <= h = item:h:t > | otherwise = h:(insert item t)> insertsort :: Ord a => [a] -> [a] > insertsort [] = [] > insertsort (h:t) = insert h (insertsort t)

Insertion sort is very similar to bubble sort.
In bubble sort, after *k* passes through the array, the *k* largest elements have bubbled to the top. (Or the *k* smallest elements have bubbled to the bottom, depending on which way you do it.) In insertion sort, after *k* passes through the array, you have a run of *k* sorted elements at the bottom of the array. Each pass inserts another element into the sorted run. So with bubble sort, each pass takes less time than the previous one, but with insertion sort, each pass may take more time than the previous one.

In the best case of an already sorted array, this implementation of insertion sort takes O(*n*) time: in each iteration, the first remaining element of the input is only compared with the last element of the result.
It takes O(*n*^{2}) time in the average and worst cases, which makes it impractical for sorting large numbers of elements.
However, insertion sort's inner loop is very fast, which often makes it one of the fastest algorithms for sorting small numbers of elements, typically less than 10 or so.

D.L. Shell made an improvement to the algorithm, called Shellsort, that compares elements separated by a distance that decreases on each pass. Quicksort works by dividing the array to be sorted into smaller runs to be sorted separately; highly optimized implementations of Quicksort often use insertion sort to sort these runs once they get small enough.