Add Heap Sort test

Author: LyangHiga

src/data-structures/heaps/bHNode.ts

@@ -4,4 +4,4 @@ class BHNode<T> {
   constructor(public key: T, public val: number) {}
 }
 
-export = BHNode;
+export default BHNode;

src/data-structures/heaps/minHeap.ts

@@ -343,4 +343,4 @@ class MinHeap<T> {
   };
 }
 
-export = MinHeap;
+export default MinHeap;

src/sort/heapSort.test.ts

@@ -0,0 +1,16 @@
+import heapSort from "./heapSort";
+
+describe("Heap Sort Test", () => {
+  test("Testing if HS sort a random array", () => {
+    const nTimes = 100;
+    const SIZE = 100;
+    for (let i = 0; i < nTimes; i++) {
+      const arr = Array.from({ length: SIZE }, () =>
+        Math.floor(Math.random() * 1000)
+      );
+      const sortedArr = heapSort(arr);
+      const jsSortedArr = arr.slice().sort((a, b) => a - b);
+      expect(sortedArr).toEqual(jsSortedArr);
+    }
+  });
+});

src/sort/heapSort.ts

@@ -1,13 +1,13 @@
-const MinHeap = require("../data-structures/minHeap");
+import MinHeap from "../data-structures/heaps/minHeap";
 
 const heapSort = (arr: number[]) => {
   const minHeap = new MinHeap();
   const result = [];
-  minHeap.buildHeap(arr);
+  minHeap.buildHeap(arr, [...arr.keys()]);
   while (!minHeap.isEmpty()) {
-    result.push(minHeap.dequeue().val);
+    result.push(minHeap.dequeue()!.val);
   }
   return result;
 };
 
-export = heapSort;
+export default heapSort;