插入排序

#include<iostream>using namespace std;const static int MAX = 100;void traverse(int a[], int n) {    for(int i=0; i<n; i++) {        if (i) cout << " ";        cout << a[i];    }    cout << endl;}void insertSort(int a[], int n) {    int i, j, v;    for(int i=1; i < n; i++) {        int v = a[i];        j = i - 1;        while(j >= 0 && a[j] > v) {            a[j+1] = a[j];            j = j - 1;        }        a[j + 1] = v;    }    traverse(a, n);}int main() {    int a[MAX];    int n;    cin >> n;    for(int i=0; i<n; i++) cin >> a[i];    insertSort(a, n);    return 0;}