插入排序
1 void insertion_sort(int v[], int n) {
2 for (int i = 1; i < n; i++) {
3 int k = v[i];
4 int j = i;
5 for (; j > 0; j--) {
6 if (v[j - 1] > k) {
7 v[j] = v[j - 1];
8 } else {
9 break;
10 }
11 }
12 v[j] = k;
13 }
14 }
