ronith
5/29/2018 - 8:17 PM

insertion sort

#include <iostream>
using namespace std;

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

int main(){
    int n;
    cout << "No.of elements \n";
    cin >> n;
    int a[n];
    cout << "Enter the elements \n";
    for (int i = 0;i<n;i++)
        cin >> a[i];

    insertion(a,n);
    for (int i = 0;i<n;i++)
            cout << a[i] << "  ";

}