insertion_sort.easy

procedure insertion_sort(A,n)

array A(1:n)
for i = 2 to n do
   key = A(i)
   j = i - 1
   while j > 0 and A(j) > key do
      A(j+1) = A(j)
      j = j - 1
   endwhile
   A(j+1) = key
endfor
end insertion_sort