Adding TODOs

Author: LyangHiga

src/data-structures/heaps/minHeap.ts

@@ -1,3 +1,5 @@
+// TODO: Add unit test
+
 import BHNode from "./bHNode";
 
 class MinHeap<T> {
@@ -67,7 +69,7 @@ class MinHeap<T> {
     } else {
       smallIdx = l;
     }
-    // swap element from idx with greater
+    // swap parent and smaller child
     [this.values[idx], this.values[smallIdx]] = [
       this.values[smallIdx],
       this.values[idx],
@@ -108,6 +110,7 @@ class MinHeap<T> {
   //    In this case second param <keys> is not used
   // In any case the Heap is build in linear time
   // Returns: this Heap
+  // TODO: static method
   buildHeap = (arr: number[] | Map<T, number>, keys: T[]) => {
     // Returns false if this heap is not empty
     if (!this.isEmpty()) return false;

src/dynamic-programming/sequenceAlignment.ts

@@ -1,3 +1,5 @@
+// TODO: needlemanWunsch implementation! already done in another repo
+
 // inputs: Stirng X and Y
 //          sigma for gap penalty
 //          Alpha: matrix for mismatch cost
@@ -15,7 +17,7 @@ const sq = (
 
   // for empty strings
   for (let i = 0; i < m; i++) arr[i][0] = i * sigma;
-  for (let j = 0; j < m; j++) arr[0][j] = j * sigma;
+  for (let j = 0; j < n; j++) arr[0][j] = j * sigma;
 
   // case 1: match cost + Xi-1 Yj-1
   // case 2: sigma + Xi-1 Yj

src/sort/heapSort.ts

@@ -1,5 +1,7 @@
 import MinHeap from "../data-structures/heaps/minHeap";
 
+// TODO: use Heap interface so it's possible to use any heap implementation
+//      EG, Fibonacci heap
 const heapSort = (arr: number[]) => {
   const minHeap = new MinHeap();
   const result = [];