[ create a new paste ] login | about

Link: http://codepad.org/JleKvOo9    [ raw code | output | fork ]

C++, pasted on Oct 18:
#include<stdio.h>


void swap (int &a, int &b)
{
    int t =a;
    a=b;
    b=t;
}

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

void printarr(int a[], int n){
    for (int  i = 0; i < n; i++)
    {
        printf("%d  ", a[i]);
    } 
}
int main(){ 
    int a[]= {9,2,6,4,3,7};
    int n = sizeof(a)/sizeof(a[0]);
    
    insertionsort(a,n);
    printarr(a,n);
    return 0;
}


Output:
1
2  3  4  6  7  9  


Create a new paste based on this one


Comments: