说明INSERTION-SORT在数组A=<31,41,59,26, 41,58>上的执行过程
int[] A = { 31,41,59,26,41,58 };
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;
}
}
for (int m = 0; m < A.Length; m++)
{
Response.Write(A[m].ToString() + "<br/>");
}