added tests

Author: loiane

src/ts/algorithms/greedy/knapsack.ts

@@ -1,4 +1,4 @@
-function knapSack(capacity: number, weights: number[], values: number[]) {
+export function knapSack(capacity: number, weights: number[], values: number[]) {
   const n = values.length;
   let load = 0;
   let val = 0;

src/ts/algorithms/greedy/longest-common-subsequence.ts

@@ -1,4 +1,4 @@
-function lcs(wordX: string, wordY: string, m = wordX.length, n = wordY.length): number {
+export function lcs(wordX: string, wordY: string, m = wordX.length, n = wordY.length): number {
   if (m === 0 || n === 0) {
     return 0;
   }

src/ts/algorithms/greedy/min-coin-change.ts

@@ -1,4 +1,4 @@
-function minCoinChange(coins: number[], amount: number) {
+export function minCoinChange(coins: number[], amount: number) {
   const change: number[] = [];
   let total = 0;
   for (let i = coins.length; i >= 0; i--) {

src/ts/index.ts

@@ -63,9 +63,17 @@ export { findMinValue as findMinValue } from './algorithms/search/min-max-search
 
 // chapter 14
 export { binarySearch as binarySearchRecursive } from './algorithms/search/binary-search-recursive';
-export { minCoinChange as minCoinChange } from './algorithms/dynamic-programing/min-coin-change';
-export { ratInAMaze as ratInAMaze } from './algorithms/backtracking/rat-in-maze';
-export { sudokuSolver as sudokuSolver } from './algorithms/backtracking/sudoku-solver';
+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';
+
 
 
 /* import { hotPotato } from './others/hot-potato';

test/ts/algorithms/greedy/knapsack.spec.ts

@@ -0,0 +1,15 @@
+import 'mocha';
+import { expect } from 'chai';
+import { knapSackGreedy } from '../../../../src/ts/index';
+
+describe('Min Coin Change Greedy', () => {
+  const SIZE = 100;
+
+  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);
+  });
+});

test/ts/algorithms/greedy/longest-common-subsequence.spec.ts

@@ -0,0 +1,14 @@
+import 'mocha';
+import { expect } from 'chai';
+import { minCoinChangeGreedy } from '../../../../src/ts/index';
+
+describe('Min Coin Change Greedy', () => {
+
+  const SIZE = 100;
+
+  it('works with greedy approach', () => {
+    expect(minCoinChangeGreedy([1, 5, 10], 15)).to.deep.equal([10, 5]);
+    expect(minCoinChangeGreedy([1, 3, 4], 6)).to.deep.equal([4, 1, 1]);
+  });
+
+});