Insertion Sort

#include <stdio.h>

void main()

{

int a[100];

int n, j, i, key;

printf("Enter size of array: ");

scanf("%d", &n);

for(i = 0; i < n; i++)

{

printf("Enter value: ");

scanf("%d", &a[i]);

}

for(i = 1; i < n; i++)

{

key = a[i];

j = i - 1;

while(j >= 0 && a[j] > key)

{

a[j + 1] = a[j];

j = j - 1;

}

a[j + 1] = key;

}

printf("Sorted array: \n");

for(i = 0; i < n; i++)

{

printf("%d ", a[i]);

}

printf("\n");

}