Forgot about these classic but inefficient ones

Author: cooperblacks

Sorting/insertion-sort.c

@@ -0,0 +1,16 @@
+// Algorithm: Insertion Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+void insertionSort(int arr[], int n) {
+    for (int i = 1; i < n; i++) {
+        int key = arr[i];
+        int j = i - 1;
+        while (j >= 0 && arr[j] > key) {
+            arr[j + 1] = arr[j];
+            j--;
+        }
+        arr[j + 1] = key;
+    }
+}

Sorting/insertion-sort.java

@@ -0,0 +1,16 @@
+// Algorithm: Insertion Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+public static void insertionSort(int[] arr) {
+    for (int i = 1; i < arr.length; i++) {
+        int key = arr[i];
+        int j = i - 1;
+        while (j >= 0 && arr[j] > key) {
+            arr[j + 1] = arr[j];
+            j--;
+        }
+        arr[j + 1] = key;
+    }
+}

Sorting/insertion-sort.js

@@ -0,0 +1,16 @@
+// Algorithm: Insertion Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+function insertionSort(arr) {
+    for (let i = 1; i < arr.length; i++) {
+        let key = arr[i];
+        let j = i - 1;
+        while (j >= 0 && arr[j] > key) {
+            arr[j + 1] = arr[j];
+            j--;
+        }
+        arr[j + 1] = key;
+    }
+}

Sorting/insertion-sort.py

@@ -0,0 +1,13 @@
+# Algorithm: Insertion Sort
+# Type: Sorting (Comparison-based)
+# Time Complexity: O(n^2)
+# Space Complexity: O(1)
+
+def insertion_sort(arr):
+    for i in range(1, len(arr)):
+        key = arr[i]
+        j = i - 1
+        while j >= 0 and arr[j] > key:
+            arr[j + 1] = arr[j]
+            j -= 1
+        arr[j + 1] = key

Sorting/insertion-sort.txt

@@ -0,0 +1,13 @@
+// Algorithm: Insertion Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+function insertionSort(arr):
+    for i from 1 to length(arr) - 1:
+        key = arr[i]
+        j = i - 1
+        while j >= 0 and arr[j] > key:
+            arr[j + 1] = arr[j]
+            j = j - 1
+        arr[j + 1] = key

Sorting/selection-sort.c

@@ -0,0 +1,17 @@
+// Algorithm: Selection Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+void selectionSort(int arr[], int n) {
+    for (int i = 0; i < n - 1; i++) {
+        int min_idx = i;
+        for (int j = i + 1; j < n; j++) {
+            if (arr[j] < arr[min_idx])
+                min_idx = j;
+        }
+        int temp = arr[i];
+        arr[i] = arr[min_idx];
+        arr[min_idx] = temp;
+    }
+}

Sorting/selection-sort.java

@@ -0,0 +1,19 @@
+// Algorithm: Selection Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+public static void selectionSort(int[] arr) {
+    int n = arr.length;
+    for (int i = 0; i < n - 1; i++) {
+        int minIdx = i;
+        for (int j = i + 1; j < n; j++) {
+            if (arr[j] < arr[minIdx]) {
+                minIdx = j;
+            }
+        }
+        int temp = arr[i];
+        arr[i] = arr[minIdx];
+        arr[minIdx] = temp;
+    }
+}

Sorting/selection-sort.js

@@ -0,0 +1,17 @@
+// Algorithm: Selection Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+function selectionSort(arr) {
+    const n = arr.length;
+    for (let i = 0; i < n - 1; i++) {
+        let minIdx = i;
+        for (let j = i + 1; j < n; j++) {
+            if (arr[j] < arr[minIdx]) {
+                minIdx = j;
+            }
+        }
+        [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];
+    }
+}

Sorting/selection-sort.py

@@ -0,0 +1,13 @@
+# Algorithm: Selection Sort
+# Type: Sorting (Comparison-based)
+# Time Complexity: O(n^2)
+# Space Complexity: O(1)
+
+def selection_sort(arr):
+    n = len(arr)
+    for i in range(n):
+        min_idx = i
+        for j in range(i + 1, n):
+            if arr[j] < arr[min_idx]:
+                min_idx = j
+        arr[i], arr[min_idx] = arr[min_idx], arr[i]

Sorting/selection-sort.txt

@@ -0,0 +1,12 @@
+// Algorithm: Selection Sort
+// Type: Sorting (Comparison-based)
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+
+function selectionSort(arr):
+    for i from 0 to length(arr) - 1:
+        minIndex = i
+        for j from i+1 to length(arr) - 1:
+            if arr[j] < arr[minIndex]:
+                minIndex = j
+        swap arr[i] and arr[minIndex]