摘要：第二章#include <stdio.h> #include <stdlib.h> #include <time.h> //插入排序void InsertSort(int A[], int n){ int i, j, key; for(i=1; i<n; i++) { key = A[i]; j = i-1; while(A[j] > key && j>=0) { A[j+1] = A[j]; j--; } A[j+1] = key;... 阅读全文