算法导论1.1

int[] A = { 5, 2, 4, 6, 1, 3 };

for (int J = 1; J < A.Length; J++)
{
int key = A[J];
int I = J - 1;

while (I >= 0 && A[I] > key)
{
A[I + 1] = A[I];
I = I - 1;
A[I+1] = key;
}
}

J=1  ,key:5  ,result:2 5 4 6 1 3
J=2  ,key:4  ,result:2 4 5 6 1 3
J=3  ,key:6  ,result:2 4 5 6 1 3
J=4  ,key:7  ,result:1 2 4 5 6 3
J=5  ,key:3  ,result:1 2 3 4 5 6  完成