[Algorithm Design and Techniques]

Author: loiane

.gitignore

@@ -6,5 +6,6 @@ coverage
 coverage.lcov
 mochawesome-report/*
 dist/js/*
+dist-/*
 dist/ts/*
 snippet.js

src/js/algorithms/dynamic-programing/knapsack.js

@@ -4,9 +4,9 @@ function findValues(n, capacity, kS) {
   // console.log('Items that are part of the solution:');
   while (i > 0 && k > 0) {
     if (kS[i][k] !== kS[i - 1][k]) {
-      /*console.log(
-              'item ' + i + ' can be part of solution w,v: ' + weights[i - 1] + ',' + values[i - 1]
-            );*/
+      //console.log(
+      //        'item ' + i + ' can be part of solution w,v: ' + weights[i - 1] + ',' + values[i - 1]
+      //      );
       i--;
       k -= kS[i][k];
     } else {

src/js/algorithms/search/binary-search-recursive.js

@@ -7,11 +7,11 @@ function binarySearchRecursive(array, value, low, high, compareFn = defaultCompa
     const element = array[mid];
     if (compareFn(element, value) === Compare.LESS_THAN) {
       return binarySearchRecursive(array, value, mid + 1, high, compareFn);
-    } else if (compareFn(element, value) === Compare.BIGGER_THAN) {
+    }
+    if (compareFn(element, value) === Compare.BIGGER_THAN) {
       return binarySearchRecursive(array, value, low, mid - 1, compareFn);
-    } else {
-      return mid;
     }
+    return mid;
   }
   return DOES_NOT_EXIST;
 }