WAP to sort an array using insertion sort.

#include<stdio.h>
 #include<stdlib.h>

 int main()
 {
 int a[10],i,j,t,k,n;
 printf("enter no of elements elements");
 scanf("%d",&n);
for(i=0;i<=n-1;i++)
 {
 scanf("%d",&a[i]);
 }
 for(i=1;i<n;i++)
 {
 t=a[i];j=i-1;
 while(t<a[j] && j>=0)
 {
 a[j+1]=a[j];
 j--;
 }
 a[j+1]=t;
 }
for(i=0;i<=n-1;i++)
 printf("%d\t",a[i]);
 printf("\n");
 system("PAUSE");
 }
Advertisements

Leave a comment

Filed under TUTORIALS

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s