插入排序

void InsertSort(int *p, int n) { int i, j; int key; for (i = 1; i < n; ++i) { j = i - 1; key = p[i]; while ((j >= 0) && (p[j] < key)) { p[j+1] = p[j]; j--; } p[j+1] = key; } }