insertion sort

#include <iostream>

using namespace std;

void insertion(int a[6],int n)
{ int j;
    for(int i=1;i<n;i++)
    {
        int key;
        key=a[i];
        j=i-1;
        
        while(j>=0&&key<a[j])
        {
            a[j+1]=a[j];
            j--;
        }
        a[j+1]=key;
    }
    
    for(int i=0;i<n;i++)
    {
        cout<<a[i]<<endl;
    }
}

int main()
{
    int a[6]={3,4,2,5,1,6};
    int n=sizeof(a)/sizeof(a[0]);
    insertion(a,6);

    return 0;
}