#include <stdio.h> |
void Insertion_Sort( int a[], int n) |
{ |
int i,j; |
for (i=1;i<n;i++) |
{ |
int key=a[i]; |
for (j=i;j>0&&a[j-1]>key;--j) |
a[j]=a[j-1]; |
a[j]=key; |
} |
} |
int main() |
{ |
int a[]={12,9,3,7,14,11}; |
int n=6,i; |
Insertion_Sort(a,n); |
for (i=0;i<n;i++) |
printf ( "%d " ,a[i]); |
return 0; |
} |