--fix : eslint & coverage 100%

Author: TheSTL

src/_Searching_/TernarySearch/TernarySearch.test.js

@@ -24,10 +24,14 @@ describe('Ternary Search', () => {
   describe('When element to find is at random position ', () => {
     it('Ternary search with Loop', () => {
       expect(ternarySearch(array, 3)).toEqual(2);
+      expect(ternarySearch(array, 5)).toEqual(4);
     });
     it('Ternary serach with recursion', () => {
       expect(ternarySearchRecursive(array, low, high, 4)).toEqual(3);
     });
+    it('Ternary serach with recursion', () => {
+      expect(ternarySearchRecursive(array, low, high, 5)).toEqual(4);
+    });
   });
   describe('When element to find is no present in array ', () => {
     it('Ternary search with Loop', () => {
@@ -37,5 +41,4 @@ describe('Ternary Search', () => {
       expect(ternarySearchRecursive(array, low, high, 10)).toEqual(null);
     });
   });
-  
 });

src/_Searching_/TernarySearch/index.js

@@ -1,53 +1,52 @@
 /**
  * Note: Array must be sorted for ternary search
- * Complexity: 
+ * Complexity:
  * Worst case time complexity: O(log N)
  * Average case time complexity: O(log N)
  * Best case time complexity: O(1)
  * Space complexity: O(1)
 */
-function ternarySearch(arr, key){
-    let low = 0;
-    let high = arr.length - 1;
-    while(low <= high){
-        let lowMiddle = low + Math.floor((high - low) / 3);
-        let highMiddle = low + 2 * Math.floor((high - low) / 3);
-        if(key == arr[low]){
-            return low;
-        } else if(key  == arr[high]){
-            return high;
-        } else if(key <= arr[lowMiddle]){
-            high = lowMiddle;
-        } else if(key > arr[lowMiddle] && key <= arr[highMiddle]){
-            low = lowMiddle + 1;
-            high = highMiddle;
-        } else {
-            low = highMiddle + 1;
-        }
+function ternarySearch(arr, key) {
+  let low = 0;
+  let high = arr.length - 1;
+  while (low <= high) {
+    const lowMiddle = low + Math.floor((high - low) / 3);
+    const highMiddle = low + 2 * Math.floor((high - low) / 3);
+    if (key === arr[low]) {
+      return low;
+    } if (key === arr[high]) {
+      return high;
+    } if (key <= arr[lowMiddle]) {
+      high = lowMiddle;
+    } else if (key > arr[lowMiddle] && key <= arr[highMiddle]) {
+      low = lowMiddle + 1;
+      high = highMiddle;
+    } else {
+      low = highMiddle + 1;
     }
-    return null;
+  }
+  return null;
 }
 
-function ternarySearchRecursive(arr, low, high, key){
-    if(high >= low){
-        let highMiddle = low + 2 * Math.floor((high - low) / 3);
-        let lowMiddle = low + Math.floor((high - low) / 3);
-        if(key === arr[lowMiddle]){
-            return lowMiddle;
-        } else if(key === arr[highMiddle]){
-            return highMiddle;
-        } else if(key < arr[lowMiddle]){
-            return ternarySearchRecursive(arr, low, lowMiddle - 1, key);
-        } else if(key > arr[lowMiddle] && key < arr[highMiddle]){
-            return ternarySearchRecursive(arr, lowMiddle + 1, highMiddle - 1, key);
-        } else {
-            return ternarySearchRecursive(arr, highMiddle + 1, high, key);
-        } 
-    } 
-    return null;
+function ternarySearchRecursive(arr, low, high, key) {
+  if (high >= low) {
+    const highMiddle = low + 2 * Math.floor((high - low) / 3);
+    const lowMiddle = low + Math.floor((high - low) / 3);
+    if (key === arr[lowMiddle]) {
+      return lowMiddle;
+    } if (key === arr[highMiddle]) {
+      return highMiddle;
+    } if (key < arr[lowMiddle]) {
+      return ternarySearchRecursive(arr, low, lowMiddle - 1, key);
+    } if (key > arr[lowMiddle] && key < arr[highMiddle]) {
+      return ternarySearchRecursive(arr, lowMiddle + 1, highMiddle - 1, key);
+    }
+    return ternarySearchRecursive(arr, highMiddle + 1, high, key);
+  }
+  return null;
 }
 
 module.exports = {
-    ternarySearch,
-    ternarySearchRecursive
+  ternarySearch,
+  ternarySearchRecursive,
 };