Insertion Sort

/* O(n^2) */

void Insertion(int ar[],int n){    for(int i = 1;i<n;i++)    {        int get = ar[i];        int j = i-1;        while(j>=0 && ar[j]>get)        {            ar[j+1] = ar[j];            j--;        }        ar[j+1] = get;    }}