Question

算法排序分析的问题代码：for j=2 to length[A]do key=A[j]insert A[j] into

Answer 1

插入排序.

while i>0 and A[i]>key

do A[i+1]=A[i]

i=i-1

上面三句可以翻译成一句话：

while(i > 0 && A[i] > key)

{

A[i+1] = A[i];

i = i - 1;

}