void insertion_digui_sort(int A[], int i) {
if (i <= 1) {
return;
}
insertion_digui_sort(A, i - 1);
int key = A[i - 1];
int j = i - 2;
while (j >= 0 && A[j] < key) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = key;
}
用递归写的嘿嘿