insertion_sort

Author: BaseMax

Diff for: README.md

@@ -1,2 +1,38 @@
 # Sorting Algorithms (Sort)
 
+This is a collection of sorting algorithms implemented in C.
+
+## Algorithms
+
+- Bubble Sort
+- Insertion Sort
+- Selection Sort
+- Merge Sort
+- Quick Sort
+
+Other algorithms are not still implemented:
+
+- Heap Sort
+- Counting Sort
+- Radix Sort
+- Bucket Sort
+- Shell Sort
+- Comb Sort
+- Gnome Sort
+- Cocktail Sort
+- Pigeonhole Sort
+- Cycle Sort
+- Stooge Sort
+- Bitonic Sort
+- Pancake Sort
+- Bogo Sort
+- Bogosort
+- Slow Sort
+- Smooth Sort
+- Strand Sort
+- Tree Sort
+- Cube Sort
+- Odd-Even Sort
+- Bitonic Sort
+- Brick Sort
+

Diff for: a.exe

@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void insertion_sort(int *arr, int n) {
+    int temp;
+    for (int i = 1; i < n; i++) {
+        int j = i;
+        while (j > 0 && arr[j] < arr[j - 1]) {
+            temp = arr[j];
+            arr[j] = arr[j - 1];
+            arr[j - 1] = temp;
+            j--;
+        }
+    }
+}
+
+int main(int argc, char** argv) {
+    int arr[] = { 5, 4, 3, 2, 1 };
+    int n = sizeof(arr) / sizeof(arr[0]);
+
+    insertion_sort(arr, n);
+
+    for (int i = 0; i < n; i++) {
+        printf("%d ", arr[i]);
+    }
+
+    return 0;
+}