插入排序

#include<iostream>
using namespace std;


void Insertion_Sort(int a[],int n)
{
    if (n == 1)
        exit(1);
    for (int k = 1; k < n; k++)
    {
        int x = a[k];
        int j = k - 1;
        while (j >= 0 && a[j] > x)
        {
            a[j + 1] = a[j];
            j--;
        }
        a[j + 1] = x;
    }
}


void main()
{
    int a[10];
    for (int i = 0; i < 10; i++)
        a[i] = 10 - i;
    int n=sizeof(a) / sizeof(int);
    Insertion_Sort(a, n);
    for (int i = 0; i < 10; i++)
        cout << a[i] << endl;
}