fixed lint and tests

Author: loiane

Diff for: examples/PacktDataStructuresAlgorithms.min.js

@@ -55,7 +55,7 @@
   },
   "devDependencies": {
     "@types/chai": "^4.1.2",
-    "@types/mocha": "^5.2.0",
+    "@types/mocha": "^5.0.0",
     "babel-cli": "^6.26.0",
     "babel-core": "^6.26.0",
     "babel-eslint": "^8.2.2",

Diff for: examples/PacktDataStructuresAlgorithms.min.js.map

@@ -4,7 +4,7 @@ function partition(array, left, right, compareFn) {
   const pivot = array[Math.floor((right + left) / 2)];
   let i = left;
   let j = right;
-  
+
   while (i <= j) {
     while (compareFn(array[i], pivot) === Compare.LESS_THAN) {
       i++;

Diff for: package.json

@@ -1,11 +1,6 @@
 import { Compare, defaultCompare, ICompareFunction, swap } from '../../util';
 
-const partition = function(
-  array: any[],
-  left: number,
-  right: number,
-  compareFn: ICompareFunction<any>
-) {
+const partition = function(array: any[], left: number, right: number, compareFn: ICompareFunction<any>) {
   const pivot = array[Math.floor((right + left) / 2)];
   let i = left;
   let j = right;

Diff for: src/js/algorithms/sorting/quicksort.js

@@ -20,7 +20,7 @@ export function parenthesesChecker(symbols: string) {
         top = stack.pop();
         if (!(opens.indexOf(top) === closers.indexOf(symbol))) {
           balanced = false;
-        } 
+        }
       }
     }
     index++;

Diff for: src/ts/algorithms/sorting/quicksort.ts

@@ -22,7 +22,7 @@ export function fibonacciMemoization(n: number) {
   if (n < 1) { return 0; }
   const memo = [0, 1];
   const fibonacciMem = (num: number): number => {
-    // if (memo[num] != null) { return memo[num]; }
+    if (memo[num] != null) { return memo[num]; }
     return (memo[num] = fibonacciMem(num - 1) + fibonacciMem(num - 2));
   };
   return fibonacciMem(n);