INSERTION-SORT: INTRODUCTION TO ALGORITHMS

Pseudo code

INSERTION-SORT(A)
1 for j=2 to A.length
2     key = A[j]
3     //Insert A[j] into the sorted sequence A[1..j-1]
4     i = j-1
5     while i>0 and A[i]>key
6         A[i+1] = A[i]
7         i = i-1
8     A[i+1] = key

---

Reference

<< Introduction to Algorithms >> Third Edition, THOMAS H. CORMEN, CHARLES E. LEISERSON, RONALD L. RIVEST, CLIFFORD STEIN.