Insertion Sort.c

#include <math.h>
#include <stdio.h>
void insertionSort(int arr[], int n)
{
	int i, key, j;
	for (i = 1; i < n; i++) {
		key = arr[i];
		j = i - 1;
		while (j >= 0 && arr[j] > key) {
			arr[j + 1] = arr[j];
			j = j - 1;
		}
		arr[j + 1] = key;
	}
}

void printArray(int arr[], int n)
{
	int i;
	for (i = 0; i < n; i++)
		printf("%d ", arr[i]);
	printf("\n");
}

int main()
{
int n ;
	printf("ENTER THE NUMBER OF ELEMENTS IN THE ARRAY::\n");
	scanf("%d",&n);
	int arr[n];
	printf("ENTER THE ELEMENTS OF THE ARRAY::\n");
	for(int i=0;i<n;i++)
        scanf("%d",&arr[i]);
	insertionSort(arr, n);
	printArray(arr, n);
	return 0;
}