《算法导论》 2.1-2 (伪代码)
INSERTION-SORT(A)
for j=A.length-1 to 1
key=A[j]
i=j+1
while i<A.length+1 and A[i]<key
A[i-1]=A[i]
i=i+1
A[i]=key
《算法导论》 2.1-2 (伪代码)
INSERTION-SORT(A)
for j=A.length-1 to 1
key=A[j]
i=j+1
while i<A.length+1 and A[i]<key
A[i-1]=A[i]
i=i+1
A[i]=key