|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 |
// recursive insertion sort in ascending order //www.GauravVichare.com #include<stdio.h> void rec_insert(int ,int []); void main(void) { int a[100],i,count; printf("Enter number of elements:"); scanf("{b15f91eef52e7c6d40fd3fe45227e26332e4c02be027e4e72c6ecf7adacefb97}d",&count); printf("\nEnter elements of array:"); for(i=0;i<count;i++) scanf("{b15f91eef52e7c6d40fd3fe45227e26332e4c02be027e4e72c6ecf7adacefb97}d",&a[i]); rec_insert(count-1,a); printf("\nSorted array:"); for(i=0;i<count;i++) printf("{b15f91eef52e7c6d40fd3fe45227e26332e4c02be027e4e72c6ecf7adacefb97}d ",a[i]); } void rec_insert(int i,int a[]) { int j,temp; if(i>0) { rec_insert(i-1,a); temp=a[i]; j=i-1; while(a[j]>temp&&j>=0) { a[j+1]=a[j]; j--; } a[j+1]=temp; } } |
About Gaurav Vichare
