//Implementation of insertion sort
#include<stdio.h>
#include<conio.h>
void inssort(int[],int);
void main()
{
int ar[50],n,i;
clrscr();
printf("\n \n How many elements do u want to enter...");
scanf("%d" , &n);
printf("\n \n Enter Array element:");
for(i=0;i<n;i++)
scanf("%d" ,&ar[i]);
inssort(ar,n);
printf("\n\n The sorted array is as shown below...\n");
for(i=0;i<n;i++)
printf("%d" ,ar[i]);
getch();
}
void inssort(int a[], int n)
{
int temp,j,k;
for(k=1;k<=n;k++)
{
temp=a[k];
j=k-1;
While((temp<a[j])&&(j>=0))
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=temp;
printf("\n\n Array after every pass\n");
for(int i=0;i<n;i++)
printf("\t%d" ,a[i]);
}
}
No comments:
Post a Comment