Implemented primitive sorts (#10 IP)

Implemented Bubble and Selection sort. Added some README resources.

Author: CoffeelessProgrammer

Algorithms/README.md

@@ -17,6 +17,12 @@
 
 ## Resources
 - [Visualizing Data Structures & Algorithms](https://visualgo.net/en)
+- [Unicode Characters: RapidTables](https://www.rapidtables.com/code/text/unicode-characters.html)
+- [The Big-O Algorithm Complexity Cheat Sheet](https://www.bigocheatsheet.com/ "Big O Cheat Sheet")
+
+### Sorting
+- [Array.prototype.sort()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort)
+- [Animated Sorting: Toptal](https://www.toptal.com/developers/sorting-algorithms)
 
 ### Recursion
 - [Tail Call Optimization: ES6](https://2ality.com/2015/06/tail-call-optimization.html)

Algorithms/Sorting/Basics.ts

@@ -0,0 +1,11 @@
+const spanish = ['único', 'árbol', 'cosas', 'fútbol'];
+
+spanish.sort(function(a,b) {
+  return a.localeCompare(b, 'es');
+});
+
+console.log(spanish);
+
+// OUTPUT: [ "cosas", "fútbol", "árbol", "único" ]
+
+// RUN: deno run Algorithms/Sorting/Basics.ts

Algorithms/Sorting/BubbleSort.ts

@@ -0,0 +1,58 @@
+function bubbleSort(numbersArr: Array<number>) {
+
+  for (let i=0; i < numbersArr.length-1; ++i) {
+    for (let j=0; j < numbersArr.length-1-i; ++j) {
+      if (numbersArr[j] > numbersArr[j+1]) {
+        numbersArr[j+1] = numbersArr[j]   + numbersArr[j+1];
+        numbersArr[j]   = numbersArr[j+1] - numbersArr[j];
+        numbersArr[j+1] = numbersArr[j+1] - numbersArr[j];
+      }
+    }
+  }
+  return numbersArr;
+}
+
+function bubbleSortStrings(stringArr: Array<string>) {
+
+  let placeholder: string;
+
+  for (let i=0; i < stringArr.length-1; ++i) {
+    for (let j=0; j < stringArr.length-1-i; ++j) {
+      if (stringArr[j] > stringArr[j+1]) {
+        placeholder     = stringArr[j];
+        stringArr[j]    = stringArr[j+1];
+        stringArr[j+1]  = placeholder;
+      }
+    }
+  }
+  return stringArr;
+}
+
+
+//---------------------------------------------------------------------
+// ----------                 MAIN PROGRAM                   ----------
+//---------------------------------------------------------------------
+if (import.meta.main) {
+
+  const numbers1  = [9,6,5,3,1,8,7,2,4];
+  const numbers2  = [99, 44, 6, 2, 1, 5, 63, 87, 283, 4, 0];
+  const colors    = ["white", "black", "green", "blue", "orange"];
+
+  console.log(bubbleSort(numbers1));
+  console.log(bubbleSort(numbers2));
+  console.log(bubbleSortStrings(colors));
+
+  // RUN:   deno run Algorithms/Sorting/BubbleSort.ts
+}
+
+// --------------------------- Terminal Output: ---------------------------
+// [
+//   1, 2, 3, 4, 5,
+//   6, 7, 8, 9
+// ]
+// [
+//   0, 1, 2, 4,  5,
+//   6, 44, 63, 87, 99,
+//   283
+// ]
+// [ "black", "blue", "green", "orange", "white" ]

Algorithms/Sorting/InsertionSort.ts

@@ -0,0 +1,54 @@
+function swap(pos1: number, pos2: number, inputArr: Array<any>): void {
+  const placeholder = inputArr[pos1];
+  inputArr[pos1] = inputArr[pos2];
+  inputArr[pos2] = placeholder;
+}
+
+function insertionSort(inputArr: Array<number> | Array<string>): Array<any> {
+
+  let minValue: number | string;
+  let minIndex: number;
+
+  for (let i=0; i < inputArr.length-1; ++i) {
+    minValue = inputArr[i];
+    minIndex = i;
+    for (let j=i+1; j <= inputArr.length-1; ++j) {
+      if (inputArr[j] < minValue) {
+        minValue = inputArr[j];
+        minIndex = j;
+      }
+    }
+    swap(i, minIndex, inputArr);
+  }
+  
+  return inputArr;
+}
+
+
+//---------------------------------------------------------------------
+// ----------                 MAIN PROGRAM                   ----------
+//---------------------------------------------------------------------
+if (import.meta.main) {
+
+  const numbers1  = [9,6,5,3,1,8,7,2,4];
+  const numbers2  = [99, 44, 6, 2, 1, 5, 63, 87, 283, 4, 0];
+  const colors    = ["white", "black", "green", "blue", "orange"];
+
+  console.log(insertionSort(numbers1));
+  console.log(insertionSort(numbers2));
+  console.log(insertionSort(colors));
+
+  // RUN:   deno run Algorithms/Sorting/SelectionSort.ts
+}
+
+// --------------------------- Terminal Output: ---------------------------
+// [
+//   1, 2, 3, 4, 5,
+//   6, 7, 8, 9
+// ]
+// [
+//   0, 1, 2, 4,  5,
+//   6, 44, 63, 87, 99,
+//   283
+// ]
+// [ "black", "blue", "green", "orange", "white" ]

Algorithms/Sorting/MergeSort.ts

@@ -36,4 +36,7 @@
 - [Comprehensive List of Data Structures](https://en.wikipedia.org/wiki/List_of_data_structures "Wikipedia: DS List")
 - [Visualizing Data Structures & Algorithms](https://visualgo.net/en)
 - [The Big-O Algorithm Complexity Cheat Sheet](https://www.bigocheatsheet.com/ "Big O Cheat Sheet")
-- [Roadmap: Core Data Structures & Algorithms](https://coggle.it/diagram/W5E5tqYlrXvFJPsq/t/master-the-interview-click-here-for-course-link "Course and Mindmap by Andrei Neagoie")
+- [Roadmap: Core Data Structures & Algorithms](https://coggle.it/diagram/W5E5tqYlrXvFJPsq/t/master-the-interview-click-here-for-course-link "Course and Mindmap by Andrei Neagoie")
+
+### Curated Articles
+- [Algorithms & DS – Real Use Cases: PragmaticEngineer](https://blog.pragmaticengineer.com/data-structures-and-algorithms-i-actually-used-day-to-day/)