From 8ee67a4706957319aa0399c9c8bbdb03f985255c Mon Sep 17 00:00:00 2001
From: GohJunLe <108907711+GohJunLe@users.noreply.github.com>
Date: Mon, 8 Aug 2022 19:38:32 +0800
Subject: [PATCH] Delete src/algorithms/search/exponential-search directory

---
 .../__test__/exponentialSearch.test.js        | 35 ----------
 .../exponential-search/exponentialSearch.js   | 67 -------------------
 2 files changed, 102 deletions(-)
 delete mode 100644 src/algorithms/search/exponential-search/__test__/exponentialSearch.test.js
 delete mode 100644 src/algorithms/search/exponential-search/exponentialSearch.js

diff --git a/src/algorithms/search/exponential-search/__test__/exponentialSearch.test.js b/src/algorithms/search/exponential-search/__test__/exponentialSearch.test.js
deleted file mode 100644
index 0816af2b..00000000
--- a/src/algorithms/search/exponential-search/__test__/exponentialSearch.test.js
+++ /dev/null
@@ -1,35 +0,0 @@
-import exponentialSearch from '../exponentialSearch';
-
-describe('exponentialSearch', () => {
-  it('should search number in sorted array', () => {
-    expect(exponentialSearch([], 1)).toBe(-1);
-    expect(exponentialSearch([1], 1)).toBe(0);
-    expect(exponentialSearch([1, 2], 1)).toBe(0);
-    expect(exponentialSearch([1, 2], 2)).toBe(1);
-    expect(exponentialSearch([1, 5, 10, 12], 1)).toBe(0);
-    expect(exponentialSearch([1, 5, 10, 12, 14, 17, 22, 100], 17)).toBe(5);
-    expect(exponentialSearch([1, 5, 10, 12, 14, 17, 22, 100], 1)).toBe(0);
-    expect(exponentialSearch([1, 5, 10, 12, 14, 17, 22, 100], 100)).toBe(7);
-    expect(exponentialSearch([1, 5, 10, 12, 14, 17, 22, 100], 0)).toBe(-1);
-  });
-
-  it('should search object in sorted array', () => {
-    const sortedArrayOfObjects = [
-      { key: 1, value: 'value1' },
-      { key: 2, value: 'value2' },
-      { key: 3, value: 'value3' },
-      { key: 4, value: 'value4' },
-    ];
-
-    const comparator = (a, b) => {
-      if (a.key === b.key) return 0;
-      return a.key < b.key ? -1 : 1;
-    };
-
-    expect(exponentialSearch([], { key: 1 }, comparator)).toBe(-1);
-    expect(exponentialSearch(sortedArrayOfObjects, { key: 4 }, comparator)).toBe(3);
-    expect(exponentialSearch(sortedArrayOfObjects, { key: 1 }, comparator)).toBe(0);
-    expect(exponentialSearch(sortedArrayOfObjects, { key: 2 }, comparator)).toBe(1);
-    expect(exponentialSearch(sortedArrayOfObjects, { key: 3 }, comparator)).toBe(2);
-  });
-});
diff --git a/src/algorithms/search/exponential-search/exponentialSearch.js b/src/algorithms/search/exponential-search/exponentialSearch.js
deleted file mode 100644
index b9c69693..00000000
--- a/src/algorithms/search/exponential-search/exponentialSearch.js
+++ /dev/null
@@ -1,67 +0,0 @@
-import Comparator from '../../../utils/comparator/Comparator';
-
-/**
- * Binary search implementation.
- *
- * @param {*[]} sortedArray
- * @param {*} startIndex
- * @param {*} endIndex
- * @param {*} seekElement
- * @param {function(a, b)} [comparatorCallback]
- * @return {number}
- */
-
-function binarySearch(sortedArray, startIndex, endIndex, seekElement, comparatorCallback)
-{
-    const comparator = new Comparator(comparatorCallback);
-    
-    if (endIndex >= startIndex)
-    {
-        const middleIndex = startIndex + Math.floor((endIndex - startIndex) / 2);
-   
-        // If the element is present at the middle itself
-        if (comparator.equal(sortedArray[middleIndex], seekElement))
-            return middleIndex;
-   
-        // If element is smaller than middleIndex, then it can only be  present n left subarray
-        if (comparator.greaterThan(sortedArray[middleIndex], seekElement)){
-            return binarySearch(sortedArray, startIndex, middleIndex - 1, seekElement, comparatorCallback);
-        }else{
-        // Else the element can only be present in right subarray
-        return binarySearch(sortedArray, middleIndex + 1, endIndex, seekElement, comparatorCallback);
-        }
-        
-    }
-
-    // We reach here when element is not present in array
-    return -1;
-}
-
-/**
- * Exponential search implementation.
- *
- * @param {*[]} sortedArray
- * @param {*} seekElement
- * @param {function(a, b)} [comparatorCallback]
- * @return {number}
- */
-
-export default function exponentialSearch(sortedArray, seekElement, comparatorCallback)
-{
-    const comparator = new Comparator(comparatorCallback);
-    const length = sortedArray.length;
-       
-    // If element is present at first location itself
-    if(sortedArray.length != 0){
-        if (comparator.equal(sortedArray[0], seekElement))
-        return 0;
-    }
-   
-    // Find range for binary search by repeated doubling
-    let range = 1;
-    while (range < length && comparator.lessThanOrEqual(sortedArray[range], seekElement))
-        range = range * 2;
-   
-    // Call binary search for the found range.
-    return binarySearch(sortedArray, range/2, Math.min(range, length - 1), seekElement, comparatorCallback);
-}
\ No newline at end of file