[Algorithm Design and Techniques]

Author: loiane

examples/PacktDataStructuresAlgorithms.min.js

@@ -1 +1,5 @@
-const { bubbleSort } = PacktDataStructuresAlgorithms;
+const { minCoinChange } = PacktDataStructuresAlgorithms;
+
+console.log(minCoinChange([1, 5, 10], 15)); // [5, 10]
+console.log(minCoinChange([1, 3, 4], 6)); // [3, 3]
+

examples/PacktDataStructuresAlgorithms.min.js.map

@@ -0,0 +1,5 @@
+const { minCoinChangeGreedy } = PacktDataStructuresAlgorithms;
+
+console.log(minCoinChangeGreedy([1, 5, 10], 15)); // [5, 10]
+console.log(minCoinChangeGreedy([1, 3, 4], 6)); // [4, 1, 1]
+

examples/chapter14/02-MinCoinChangeDP.js

@@ -0,0 +1,8 @@
+const { knapSack } = PacktDataStructuresAlgorithms;
+
+const values = [3,4,5];
+const weights = [2,3,4];
+const capacity = 5;
+const n = values.length;
+
+console.log(knapSack(capacity, weights, values, n));

examples/chapter14/03-MinCoinChangeGreedy.js

@@ -0,0 +1,8 @@
+const { knapSackRecursive } = PacktDataStructuresAlgorithms;
+
+const values = [3,4,5];
+const weights = [2,3,4];
+const capacity = 5;
+const n = values.length;
+
+console.log(knapSackRecursive(capacity, weights, values, n));

examples/chapter14/04-KnapsackProblemDP.js

@@ -0,0 +1,7 @@
+const { knapSackGreedy } = PacktDataStructuresAlgorithms;
+
+const values = [3,4,5];
+const weights = [2,3,4];
+const capacity = 5;
+
+console.log(knapSackGreedy(capacity, weights, values));

examples/chapter14/05-KnapSackProblemRecursive.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(
+      console.log(
               'item ' + i + ' can be part of solution w,v: ' + weights[i - 1] + ',' + values[i - 1]
-            ); */
+            );
       i--;
       k -= kS[i][k];
     } else {

examples/chapter14/06-KnapSackProblemGreedy.js

@@ -0,0 +1,24 @@
+import { Compare, defaultCompare, DOES_NOT_EXIST } from '../../util';
+import { quickSort } from '../sorting/quicksort';
+
+function binarySearchRecursive(array, value, low, high, compareFn = defaultCompare) {
+  if (low <= high) {
+    const mid = Math.floor((low + high) / 2);
+    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) {
+      return binarySearchRecursive(array, value, low, mid - 1, compareFn);
+    } else {
+      return mid;
+    }
+  }
+  return DOES_NOT_EXIST;
+}
+
+export function binarySearch(array, value, compareFn = defaultCompare) {
+  const sortedArray = quickSort(array);
+  const low = 0;
+  const high = sortedArray.length - 1;
+  return binarySearchRecursive(array, value, low, high, compareFn);
+}

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

@@ -83,7 +83,14 @@ export { findMaxValue } from './algorithms/search/min-max-search';
 export { findMinValue } from './algorithms/search/min-max-search';
 
 // chapter 14
-// export { binarySearch as binarySearchRecursive } from './algorithms/search/binary-search-recursive';
+export { binarySearch as binarySearchRecursive } from './algorithms/search/binary-search-recursive';
 export { minCoinChange } from './algorithms/dynamic-programing/min-coin-change';
+export { minCoinChange as minCoinChangeGreedy } from './algorithms/greedy/min-coin-change';
+export { knapSack } from './algorithms/dynamic-programing/knapsack';
+export { knapSack as knapSackRecursive } from './algorithms/dynamic-programing/knapsack-recursive';
+export { knapSack as knapSackGreedy } from './algorithms/greedy/knapsack';
+export { lcs } from './algorithms/dynamic-programing/longest-common-subsequence';
+export { lcs as lcsPrint } from './algorithms/dynamic-programing/longest-common-subsequence-print';
+export { lcs as lcsRecursive } from './algorithms/greedy/longest-common-subsequence';
 export { ratInAMaze } from './algorithms/backtracking/rat-in-maze';
 export { sudokuSolver } from './algorithms/backtracking/sudoku-solver';