#include<stdio.h>
#include<stdlib.h>
#define max 100
int a[max];
void insertionSort(int array[], int size)
{
int i,j,step,key;
for (step = 1; step < size; step++) {
key = array[step];
j = step - 1;
while (key < array[j] && j >= 0) {
array[j + 1] = array[j];
--j;
}
array[j + 1] = key;
}
printf("After sorting: ");
for(i=0;i<size;i++)
printf("%d ",a[i]);
}
int main()
{
int n,i;
printf("Enter n : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter a[%d] : ",i);
scanf("%d",&a[i]);
}
insertionSort(a,n);
}
#include<stdlib.h>
#define max 100
int a[max];
void insertionSort(int array[], int size)
{
int i,j,step,key;
for (step = 1; step < size; step++) {
key = array[step];
j = step - 1;
while (key < array[j] && j >= 0) {
array[j + 1] = array[j];
--j;
}
array[j + 1] = key;
}
printf("After sorting: ");
for(i=0;i<size;i++)
printf("%d ",a[i]);
}
int main()
{
int n,i;
printf("Enter n : ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter a[%d] : ",i);
scanf("%d",&a[i]);
}
insertionSort(a,n);
}
