Introduction to Algorithm - Summary of Chapter 2(1) - Insertion sort

Insertion sort

Insertion sort : It expands the ordered area by place the element into the correct situation when the element is considered.

Insertion-Sort (A)    for j=2 to A.length        key = A[j]        //Insert A[j] into the sorted sequence A[1..j-1]        i = j-1        while i>0 && A[i]>key            A[i+1] = A[i]            i = i-1        A[i+1] = key

The insertion sort is stable and in place .

Some of above content refere to “Introduction to Algorithm”.