- minor updates

Author: Isaac Ramirez

src/algorithms/heap-sort/heap-sort.js

@@ -39,8 +39,10 @@ class Heap extends GenericSort {
    * @param {ComparatorFn} [comparator] - The comparator function.
    */
   static sink (a, k, n, comparator) {
+    let j
+
     while (2 * k <= n) {
-      let j = 2 * k
+      j = 2 * k
 
       // decrement indices by 1 so the array
       // can be sorted from a[0] to a[n - 1]

src/examples/test-clients/sort-compare.client.js

@@ -122,7 +122,11 @@ class SortCompare {
 
     algorithms[sortName].sort(a)
 
-    return timer.elapsedTime()
+    const elapsedTime = timer.elapsedTime()
+
+    algorithms[sortName].isSorted(a)
+
+    return elapsedTime
   }
 
   /**