Implemented insertion sort (#10 IP)

Author: CoffeelessProgrammer

Algorithms/README.md

@@ -23,6 +23,7 @@
 ### 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)
+- [Dancing Algorithms: AlgoRythmics](https://www.youtube.com/user/AlgoRythmics/videos)
 
 ### Recursion
 - [Tail Call Optimization: ES6](https://2ality.com/2015/06/tail-call-optimization.html)

Algorithms/Sorting/InsertionSort.ts

@@ -0,0 +1,63 @@
+import LinkedList from '../../Data-Structures/Linked-Lists/LinkedList.ts';
+
+
+function insertionSort(inputArr: number[] | string[]): Array<any> {
+  const sorted = new LinkedList<any>();
+
+  sorted.append(inputArr[0]);
+
+  for (let i=1; i < inputArr.length; ++i) {
+
+    let currentElement = inputArr[i];
+    let currentNode = sorted.getHead();
+
+    // Element is less than the lowest value
+    if (currentElement < sorted.getHeadValue()) {
+      sorted.prepend(currentElement);
+    }
+    // Element is greater than the highest value
+    else if (currentElement > sorted.getTailValue()) {
+      sorted.append(currentElement)
+    }
+    // Otherwise insert in its proper, sorted position
+    else {
+      for (let j=0; j < sorted.getLength()-1; ++j) {
+        if (currentNode.getValue() < currentElement && currentNode.getNext().getValue() > currentElement) {
+          sorted.insert(currentElement, j+1);
+          break;
+        }
+        currentNode = currentNode.getNext();
+      }
+    }
+  }
+  return sorted.toArray();
+}
+
+
+//---------------------------------------------------------------------
+// ----------                 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/InsertionSort.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/SelectionSort.ts

@@ -4,7 +4,7 @@ function swap(pos1: number, pos2: number, inputArr: Array<any>): void {
   inputArr[pos2] = placeholder;
 }
 
-function insertionSort(inputArr: Array<number> | Array<string>): Array<any> {
+function selectionSort(inputArr: Array<number> | Array<string>): Array<any> {
 
   let minValue: number | string;
   let minIndex: number;
@@ -34,9 +34,9 @@ if (import.meta.main) {
   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));
+  console.log(selectionSort(numbers1));
+  console.log(selectionSort(numbers2));
+  console.log(selectionSort(colors));
 
   // RUN:   deno run Algorithms/Sorting/SelectionSort.ts
 }

Data-Structures/Linked-Lists/LinkedList.ts

@@ -15,6 +15,18 @@ export default class LinkedList<T> {
     return this.length;
   }
 
+  public getHead(): Node<T> | any {
+    return this.head;
+  }
+
+  public getHeadValue(): T | any {
+    return this.head?.getValue();
+  }
+
+  public getTailValue(): T | any {
+    return this.tail?.getValue();
+  }
+
   public isEmpty(): boolean {
     return this.length === 0;
   }
@@ -166,6 +178,20 @@ export default class LinkedList<T> {
     return true;
   }
 
+  public toArray(): Array<T> | any {
+    if (this.length <= 0) return null;
+
+    const array = new Array<T>(this.length);
+
+    let currentNode = this.head;
+
+    for (let i=0; !!currentNode; ++i) {
+      array[i] = currentNode.getValue();
+      currentNode = currentNode.getNext();
+    }
+    return array;
+  }
+
   public toString(nodesPerGroup?: number): string {
     if (this.length === 0 || !this.head) {
       return "";