C Program - Sort Array Using Insertion Function
This calendar week I'm enjoying coding sorting techniques on erstwhile soundless my favourite Borland Turbo C Complier. Yesterday I managed to code around other sorting programme inwards C linguistic communication using Insertion Function. This C Program tending you lot kind an array alongside whatever random integer values. If you're a computer science educatee learning to implement sorting techniques using C Programming language therefore next code may essay out useful inwards your lab practicals. I experience cracking to portion origin code of my Insertion Sorting C Program.
C Program - Sorting Array Using Insertion Function
//Analysis of Algorithms //Insertion Sorting - C Program //Sort Array Using Insertion Function. //Program by:- GAURAV AKRANI. //TESTED:- OK #include<stdio.h> #include<conio.h> void insertion(int a[],int n) { int i,j,x,k; for(i=1;i<=n-1;i++) { j=i; x=a[i]; while(a[j-1]>x && j>0) { a[j]=a[j-1]; j=j-1; } a[j]=x; printf("\n\n The array afterwards overstep no.%d: ",i); for(k=0;k<=n-1;k++) printf("%4d",a[k]); }//end for. } //end function. void main() { int a[1000],n,i; clrscr(); printf("\n\nEnter an integer value for amount no.s of elements to hold out sorted: "); scanf("%3d",&n); for(i=0;i<=n-1;i++) { printf("\n\nEnter an integer value for chemical cistron no.%d: ",i+1); scanf("%4d",&a[i]); } insertion(a,n); printf("\n\n\nFinally sorted array is : "); for(i=0;i<=n-1;i++) printf("%4d",a[i]); }//end program. /* ----------sample output------------------ Enter an integer value for amount no.s of elements to hold out sorted: half dozen Enter an integer value for chemical cistron no.1: 67 Enter an integer value for chemical cistron no.2: 34 Enter an integer value for chemical cistron no.3: -23 Enter an integer value for chemical cistron no.4: 100 Enter an integer value for chemical cistron no.5: 0 Enter an integer value for chemical cistron no.6: -68 The array afterwards overstep no.1: 34 67 -23 100 0 -68 The array afterwards overstep no.2: -23 34 67 100 0 -68 The array afterwards overstep no.3: -23 34 67 100 0 -68 The array afterwards overstep no.4: -23 0 34 67 100 -68 The array afterwards overstep no.5: -68 -23 0 34 67 100 Finally sorted array is : -68 -23 0 34 67 100 */ 