INSERTION SORT
#include<stdio.h>
#include<conio.h>
void isort(int array[],int n);
int main()
{
int
array[10],i,n;
printf("enter
no of element:");
scanf("%d",&n);
printf("enter
element:\n");
for(i=0;i<n;i++)
{
scanf("%d",&array[i]);
}
isort(array,n);
printf("sorted
array:\n");
for(i=0;i<n;i++)
{
printf("
%d\t", array[i]);
}
getch();
}
void isort(int array[],int n)
{
int i,j,key;
for(j=1;j<n;j++)
{
key=array[j];
i=j-1;
while((key<array[i])&&(i>=0))
{
array[i+1]
= array[i];
i--;
}
array[i+1]=key;
}
}
OUTPUT
No comments:
Post a Comment