伪代码:
Insertion_Sort(A)
for j <- 2 to length[A]
do key <- A[j]
i <- j-1
while i > 0 and A[i] < key
do A[i+1] <- A[i]
i <- j-1
A[i+1] <- key
C++实现:
void InsertSort(int *list,int length)
{
for(int j = 1;j < length;j++){
int key = list[j];
int i = j + 1;
while(i >= 0 && list[i] < key){
list[i+1] = list[i];
i--
}
list[i+1] = key;
}
}