排序算法之插入排序

题目传送门

/*
    插入排序——扑克牌排序
    用zstu3539题目来验证算法的正确性
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <cstdlib>
using namespace std;

const int maxn = 1000000 + 10;
const int INF = 0x3f3f3f3f;
int a[maxn];

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


int main(void)
{
    //freopen ("rand_small.in", "r", stdin);
    int n;

    while (scanf ("%d", &n) != EOF)
    {
        if (n == 0)
            continue;
        for (int i=1; i<=n; ++i)
        {
            scanf ("%d", &a[i]);
        }
    
        InsertSort (a, n);

        bool flag = true;
        for (int i=1; i<=n; ++i)
        {
            if (flag)
            {
                printf ("%d", a[i]);
                flag = false;
            }
            else
                printf (" %d", a[i]);
        }
        puts ("");
    }

    return 0;
}