From a36e361ca1ce97df9cb7d772ced36ca3b98e8ab3 Mon Sep 17 00:00:00 2001
From: Shivani_011 <75663980+Shivani-001@users.noreply.github.com>
Date: Fri, 8 Oct 2021 22:09:28 +0530
Subject: [PATCH] insertionSort.c

---
 C/Algorithms/Sorting/insertionSort.c | 43 ++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 C/Algorithms/Sorting/insertionSort.c

diff --git a/C/Algorithms/Sorting/insertionSort.c b/C/Algorithms/Sorting/insertionSort.c
new file mode 100644
index 0000000..d0fd6bc
--- /dev/null
+++ b/C/Algorithms/Sorting/insertionSort.c
@@ -0,0 +1,43 @@
+// C program for insertion sort
+#include <math.h>
+#include <stdio.h>
+
+/* Function to sort an array using insertion sort*/
+void insertionSort(int arr[], int n)
+{
+	int i, key, j;
+	for (i = 1; i < n; i++) {
+		key = arr[i];
+		j = i - 1;
+
+		/* Move elements of arr[0..i-1], that are
+		greater than key, to one position ahead
+		of their current position */
+		while (j >= 0 && arr[j] > key) {
+			arr[j + 1] = arr[j];
+			j = j - 1;
+		}
+		arr[j + 1] = key;
+	}
+}
+
+// A utility function to print an array of size n
+void printArray(int arr[], int n)
+{
+	int i;
+	for (i = 0; i < n; i++)
+		printf("%d ", arr[i]);
+	printf("\n");
+}
+
+/* Driver program to test insertion sort */
+int main()
+{
+	int arr[] = { 12, 11, 13, 5, 6 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	insertionSort(arr, n);
+	printArray(arr, n);
+
+	return 0;
+}