插入法排序算法——DEMO

// 插入排序算法

#include <iostream>

using namespace std;

int main()
{
    const int N = 10;
    int i, j, Temp;
    int a[N] = {-9, 1, 20,-57, 10, 3, 120, 8, 19, -60};

    cout<< "Serial:";
    for ( i = 0; i< N; i++ )
    {
       cout.width(5);
       cout << i;
    }
    cout<< endl;
    cout<< "Before:";
    for ( i = 0; i< N; i++ )
    {
       cout.width(5);
       cout <<a[i];
    }
    cout<< endl;

    for ( i = 1; i< N; i++ )
    {
       j = i;
       Temp = a[i];
       while ( Temp < a[j-1]&& j > 0 )
       {
           a[j] =a[j-1];
           j--;
       }
       a[j] = Temp;
    }

    cout<< "After: ";
    for ( i = 0; i< N; i++ )
    {
       cout.width(5);
       cout <<a[i];
    }
    cout<< endl;

    return 0;
}