Data Structures Insertion Sort C Program

Data Structures Lab Manual / Data Structures Insertion Sort C Program

Program Name: Write a C Program for Insertion Sort in Data Structures

Theory

Insertion sort in virtually splits the given array into sorted and unsorted parts, then the values from the 
unsorted parts are picked and placed at the correct position in the sorted part.

Program Code

#include<stdio.h> 
#include<conio.h>

void insert(int [],int); 
void main()
{
int a[20],i,n;

printf("Enter Number of Elements: "); 
scanf("%d",&n);

printf("Enter Array Elements: "); 
for(i=0;i<n;i++)
scanf("%d",&a[i]);

insert(a,n);
getch();
}


void insert(int a[],int n)
{
int i,j,temp; 

for(i=1;i<n;i++)
{
temp=a[i];
for(j=i-1;j>=0;j--)
if(a[j]>temp)
a[j+1]=a[j];
else break;
a[j+1]=temp;
}

printf("Data After Insertion Sort: "); 
for(i=0;i<n;i++) 
printf("\t%d",a[i]);
}

Input:
Enter Number of Elements: 5
Enter Array Elements: 5 2 9 7 1

Output:
Data After Insertion Sort: 	1	2	5	7	9

Home Back