[Algorithm Design and Techniques]

Author: loiane

README.md

@@ -22,6 +22,9 @@ Work in Progress.
 * 10: [Heap](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter10)
 * 11: [Graphs](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter11)
 * 12: [Sorting and Searching Algorithms](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter12)
+* 13: [String and Math Algorithms](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter13)
+* 14: [Algorithm Design and Techniques](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter14)
+* 15: [Algorithm Complexity](https://github.com/loiane/javascript-datastructures-algorithms/tree/third-edition/examples/chapter15)
 
 ### Third Edition Updates
 

examples/PacktDataStructuresAlgorithms.min.js

@@ -0,0 +1,32 @@
+import { Compare, defaultCompare, DOES_NOT_EXIST } from '../../util';
+import { quickSort } from '../sorting/quicksort';
+
+function binarySearchRecursive<T>(
+  array: T[],
+  value: T,
+  low: number,
+  high: number,
+  compareFn = defaultCompare
+): number {
+  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<T>(array: T[], value: T, compareFn = defaultCompare) {
+  const sortedArray = quickSort(array);
+  const low = 0;
+  const high = sortedArray.length - 1;
+
+  return binarySearchRecursive(array, value, low, high, compareFn);
+}

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

@@ -60,6 +60,8 @@ export { sequentialSearch as sequentialSearch } from './algorithms/search/sequen
 export { findMaxValue as findMaxValue } from './algorithms/search/min-max-search';
 export { findMinValue as findMinValue } from './algorithms/search/min-max-search';
 
+// chapter 14
+export { binarySearch as binarySearchRecursive } from './algorithms/search/binary-search-recursive';
 
 
 /* import { hotPotato } from './others/hot-potato';

src/ts/index.ts

@@ -0,0 +1,5 @@
+import { binarySearchRecursive } from '../../../../src/ts/index';
+import { testSearchAlgorithm } from './search-algorithms-tests';
+
+testSearchAlgorithm(binarySearchRecursive, 'Binary Search Recursive');
+