[Algorithm Design and Techniques]

Author: loiane

examples/chapter14/09-MatrixChainMultiplicationDP.js

@@ -1,5 +1,4 @@
 const { matrixChainOrder } = PacktDataStructuresAlgorithms;
 
 const p = [10, 100, 5, 50, 1];
-const n = p.length;
-console.log(matrixChainOrder(p, n));
+console.log(matrixChainOrder(p));

examples/chapter14/10-MatrixChainMultiplicationRecursive.js

@@ -1,5 +1,4 @@
 const { matrixChainOrderGreedy } = PacktDataStructuresAlgorithms;
 
 const p = [10, 100, 5, 50, 1];
-const n = p.length;
-console.log(matrixChainOrderGreedy(p, n));
+console.log(matrixChainOrderGreedy(p));

src/ts/index.ts

@@ -71,6 +71,8 @@ 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 { matrixChainOrder } from './algorithms/dynamic-programing/matrix-chain-multiplication';
+export { matrixChainOrder as matrixChainOrderGreedy } from './algorithms/greedy/matrix-chain-multiplication';
 export { ratInAMaze } from './algorithms/backtracking/rat-in-maze';
 export { sudokuSolver } from './algorithms/backtracking/sudoku-solver';
 

test/js/algorithms/dynamic-programming/knapsack-recursive.spec.js

@@ -0,0 +1,15 @@
+import 'mocha';
+import { expect } from 'chai';
+import { knapSackRecursive } from '../../../../src/js/index';
+
+describe('KnapSack Dynamic Programming - Recursive', () => {
+
+  it('works with recursive approach', () => {
+    const values = [3, 4, 5];
+    const weights = [2, 3, 4];
+    const capacity = 5;
+    const n = values.length;
+
+    expect(knapSackRecursive(capacity, weights, values, n)).to.equal(7);
+  });
+});

test/js/algorithms/dynamic-programming/knapsack.spec.js

@@ -0,0 +1,15 @@
+import 'mocha';
+import { expect } from 'chai';
+import { knapSack } from '../../../../src/js/index';
+
+describe('KnapSack Dynamic Programming', () => {
+
+  it('works with DP approach', () => {
+    const values = [3, 4, 5];
+    const weights = [2, 3, 4];
+    const capacity = 5;
+    const n = values.length;
+
+    expect(knapSack(capacity, weights, values, n)).to.equal(7);
+  });
+});

test/js/algorithms/dynamic-programming/longest-common-subsequence-print.spec.js

@@ -0,0 +1,13 @@
+import 'mocha';
+import { expect } from 'chai';
+import { lcsPrint } from '../../../../src/js/index';
+
+describe('LCS Dynamic Programming with print solution', () => {
+
+  it('works with DP approach with print solution', () => {
+    const wordX = 'acbaed';
+    const wordY = 'abcadf';
+
+    expect(lcsPrint(wordX, wordY)).to.equal('acad');
+  });
+});

test/js/algorithms/dynamic-programming/longest-common-subsequence.spec.js

@@ -0,0 +1,13 @@
+import 'mocha';
+import { expect } from 'chai';
+import { lcs } from '../../../../src/js/index';
+
+describe('LCS Dynamic Programming', () => {
+
+  it('works with DP approach', () => {
+    const wordX = 'acbaed';
+    const wordY = 'abcadf';
+
+    expect(lcs(wordX, wordY)).to.equal(4);
+  });
+});

test/js/algorithms/dynamic-programming/matrix-chain-multiplication.spec.js

@@ -0,0 +1,12 @@
+import 'mocha';
+import { expect } from 'chai';
+import { matrixChainOrder } from '../../../../src/js/index';
+
+describe('Matrix Chain Multiplication', () => {
+
+  it('works with DP approach', () => {
+    const p = [10, 100, 5, 50, 1];
+
+    expect(matrixChainOrder(p)).to.equal(1750);
+  });
+});

test/js/algorithms/dynamic-programming/min-coin-change.spec.js

@@ -0,0 +1,30 @@
+import 'mocha';
+import { expect } from 'chai';
+import { minCoinChange } from '../../../../src/js/index';
+
+describe('Dynamic Programming: Min Coin Change', () => {
+
+  it('works with amount 0', () => {
+    expect(minCoinChange([1, 2, 3], 0)).to.deep.equal([]);
+  });
+
+  it('works with amount 1', () => {
+    expect(minCoinChange([1, 2, 3], 1)).to.deep.equal([1]);
+  });
+
+  it('works with amount 2', () => {
+    expect(minCoinChange([1, 2, 3], 2)).to.deep.equal([2]);
+  });
+
+  it('works with amount 3', () => {
+    expect(minCoinChange([1, 2, 3], 3)).to.deep.equal([3]);
+  });
+
+  it('works with amount 4', () => {
+    expect(minCoinChange([1, 2, 3], 4)).to.deep.equal([1, 3]);
+  });
+
+  it('works with amount 6', () => {
+    expect(minCoinChange([1, 2, 3], 6)).to.deep.equal([3, 3]);
+  });
+});

test/js/algorithms/greedy/knapsack.spec.js

@@ -0,0 +1,14 @@
+import 'mocha';
+import { expect } from 'chai';
+import { knapSackGreedy } from '../../../../src/js/index';
+
+describe('KnapSack Greedy', () => {
+
+  it('works with greedy approach', () => {
+    const values = [3, 4, 5];
+    const weights = [2, 3, 4];
+    const capacity = 5;
+
+    expect(knapSackGreedy(capacity, weights, values)).to.equal(7);
+  });
+});