//C program to implement Insertion Sort
#include<stdio.h>
#include<conio.h>
#include<time.h>
void insertion_sort(int[],int);
void main()
{
int a[10],i,n;
clock_t begin,end;
clrscr();
printf("\nEnter number of elements : ");
scanf("%d",&n);
printf("\nEnter %d elements : ",n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
begin=clock();
insertion_sort(a,n);
end=clock();
printf("\nTime taken is : %lf",(end-begin)/CLOCKS_PER_SEC);
printf("\n\nSorted list : ");
for(i=0;i<n;i++)
printf("\t%d",a[i]);
getch();
}
void insertion_sort(int a[],int n)
{
int min,i,j;
for(i=0;i<n;i++)
{
min=a[i];
j=i-1;
while(j>=0 && a[j]>min)
{
delay(100);
a[j+1]=a[j];
j--;
}
a[j+1]=min;
}
}
Output:
#include<stdio.h>
#include<conio.h>
#include<time.h>
void insertion_sort(int[],int);
void main()
{
int a[10],i,n;
clock_t begin,end;
clrscr();
printf("\nEnter number of elements : ");
scanf("%d",&n);
printf("\nEnter %d elements : ",n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
begin=clock();
insertion_sort(a,n);
end=clock();
printf("\nTime taken is : %lf",(end-begin)/CLOCKS_PER_SEC);
printf("\n\nSorted list : ");
for(i=0;i<n;i++)
printf("\t%d",a[i]);
getch();
}
void insertion_sort(int a[],int n)
{
int min,i,j;
for(i=0;i<n;i++)
{
min=a[i];
j=i-1;
while(j>=0 && a[j]>min)
{
delay(100);
a[j+1]=a[j];
j--;
}
a[j+1]=min;
}
}
Output:
No comments:
Post a Comment