Insertion sort in C
#include<stdio.h> int main () { int key,i,n,a [ 100 ] ,temp ; int j = 0 ; printf( "\t Insertion sort " ); printf ( "\nEnter array size : " ); scanf( "%d" , & n ); printf ( "\nEnter actual Element in array : " ); for ( i = 0 ; i < n ; i ++) { scanf( "\n%d" , & a [ i ]); } for ( i=0 ; i < n ; i ++) { key = a [ i ]; j = j - 1 ; while ( j >= 0 && a [ j ]> key ) { a [ j + i ]= a [ j ]; j = j - 1 ; } a [ j + 1 ]= key ; } printf ( "resultant array=" ); for ( i = 0 ; i < n ; i ++) { printf( "%d\t" ,a[i] ); } } output: Insertion sort Enter array size : 5 Enter actual Element in array : 2 5 4 3 6 resultant array=2 3 4 5 6