InsertSort(A)
1 for j←2
to n do
2 key
←
A[j]
3 i←
j
- 1
4 while i
> 0
and
A[i]
>
key
do
5 A[i
+ 1]← A[i]
6 i ←
i
- 1
7 A[i
+ 1] ← key
8 return A
10 9 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 9 10