直接插入排序

#include <iostream>
using namespace std;
int main()
{
    const int MAXN = 100;
    int a[MAXN];
    int n;
    cin >> n;
    int i, j;
    for(i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for(i = 2; i <= n; i++)
    {
        if(a[i] < a[i-1])
        {
            a[0] = a[i];
            for(j = i-1; a[j] > a[0]; j--)
                a[j+1] = a[j];
            a[j+1] = a[0];
        }
    }
    for(i = 1; i <= n; i++)
        cout << a[i] << " ";
    return 0;
}

来自为知笔记(Wiz)