[Algorithm Design and Techniques]

Author: loiane

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

@@ -22,17 +22,15 @@ export function knapSack(capacity: number, weights: number[], values: number[],
   }
 
   // extra algorithm to find the items that are part of the solution
-  findValues(n, capacity, kS, values, weights);
+  findValues(n, capacity, kS);
 
   return kS[n][capacity];
 }
 
 function findValues(
   n: number,
   capacity: number,
-  kS: Array<Array<number>>,
-  weights: number[],
-  values: number[]
+  kS: Array<Array<number>>
 ) {
   let i = n;
   let k = capacity;

src/ts/algorithms/dynamic-programing/min-coin-change.ts

@@ -24,7 +24,7 @@ export function minCoinChange(coins: number[], amount: number) {
         (newMin.length || !newAmount)
       ) {
         min = [coin].concat(newMin);
-        console.log('new Min ' + min + ' for ' + amount);
+        // console.log('new Min ' + min + ' for ' + amount);
       }
     }
     return (cache[amount] = min);