feat(DESC): add sort descending option

Author: kaczor6418

src/main.ts

@@ -1,17 +1,24 @@
 import {SortDirection} from "./Enums";
 
 function insertionSort<T>(elementsList: T[], direction: SortDirection = SortDirection.ASC): void {
+    const condition: <T>(comparedElement: T, selectedElement: T) => boolean = direction === SortDirection.ASC ? ascendingCondition : descendingCondition;
     for (let selectedElementIndex: number = 1; selectedElementIndex < elementsList.length; selectedElementIndex++) {
         const key: T = elementsList[selectedElementIndex];
         let comparedElementIndex: number = selectedElementIndex - 1;
-        while (comparedElementIndex >= 0 && elementsList[comparedElementIndex] > key) {
+        while (comparedElementIndex >= 0 && condition(elementsList[comparedElementIndex], key)) {
             elementsList[comparedElementIndex + 1] = elementsList[comparedElementIndex];
             comparedElementIndex--;
         }
         elementsList[comparedElementIndex + 1] = key;
     }
 }
 
-const examplerray = [31, 41, 59, 26, 41, 58];
-insertionSort(examplerray);
-console.log(examplerray);
+const ascendingCondition: <T>(comparedElement: T, selectedElement: T) => boolean = <T>(comparedElement: T, selectedElement: T) => comparedElement > selectedElement;
+const descendingCondition: <T>(comparedElement: T, selectedElement: T) => boolean = <T>(comparedElement: T, selectedElement: T) => comparedElement < selectedElement;
+
+const exampleArray1 = [31, 41, 59, 26, 41, 58];
+const exampleArray2 = [31, 41, 59, 26, 41, 58];
+insertionSort(exampleArray1, SortDirection.ASC);
+insertionSort(exampleArray2, SortDirection.DESC);
+console.log(exampleArray1);
+console.log(exampleArray2);