在左手为空的时候,将一摞无顺序纸牌插入手中。从右向左比较。
def InsertionSort(A, n):
for i in range (1, n):
key = A[i];
j = i-1;
a = j;
while(j>=0 and (A[j]> key)):
A[j+1] = A[j];
j = j-1;
a = j;
print(a);
A[a+1] = key;
return A;