fixing recursive search, removing unnecessary if

Author: Kyle-Ski

Diff for: src/_Searching_/TernarySearch/TernarySearch.test.js

@@ -26,7 +26,7 @@ describe('Ternary Search', () => {
       expect(ternarySearch(array, 3)).toEqual(2);
     });
     it('Ternary serach with recursion', () => {
-      expect(ternarySearchRecursive(array, low, high, 3)).toEqual(2);
+      expect(ternarySearchRecursive(array, low, high, 4)).toEqual(3);
     });
   });
   describe('When element to find is no present in array ', () => {

Diff for: src/_Searching_/TernarySearch/index.js

@@ -29,15 +29,13 @@ function ternarySearch(arr, key){
 }
 
 function ternarySearchRecursive(arr, low, high, key){
-    if(high > low){
+    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[high]){
-            return high;
         } else if(key < arr[lowMiddle]){
             return ternarySearchRecursive(arr, low, lowMiddle - 1, key);
         } else if(key > arr[lowMiddle] && key < arr[highMiddle]){