Insertion Sort

#include <iostream>
using namespace std;
int a[100],n;
void insertion_sort(int a[], int n)
{
    for(int j=2;j<=n;j++)
    {
        int key=a[j];
        int i=j-1;
        while(i>0&&a[i]>key)
        {
            a[i+1]=a[i];
            i-=1;
            a[i+1]=key;
        }
    }
    for(int i=1;i<=n;i++) cout<<a[i]<<" ";
    cout<<endl;
}
int main()
{
    while(cin>>n)
    {
        for(int i=1;i<=n;i++) cin>>a[i];
        insertion_sort(a,n);
    }
    return 0;
}