Update ExponentialSearch

anahita-singla · abranhe · commit 03b2195d24de · 2020-10-06T16:48:38.000-04:00
diff --git a/searches/ExponentialSearch b/searches/ExponentialSearch
@@ -3,11 +3,11 @@
 #include <bits/stdc++.h> 
 using namespace std; 
   
-int binarySearch(int arr[], int, int, int); 
+int BinarySearch(int arr[], int, int, int); 
   
 // Returns position of first occurrence of 
 // x in array 
-int exponentialSearch(int arr[], int n, int x) 
+int ExponentialSearch(int arr[], int n, int x) 
 { 
     // If x is present at firt location itself 
     if (arr[0] == x) 
@@ -20,13 +20,13 @@ int exponentialSearch(int arr[], int n, int x)
         i = i*2; 
   
     //  Call binary search for the found range. 
-    return binarySearch(arr, i/2, min(i, n), x); 
+    return BinarySearch(arr, i/2, min(i, n), x); 
 } 
   
 // A recursive binary search function. It returns 
 // location of x in  given array arr[l..r] is 
 // present, otherwise -1 
-int binarySearch(int arr[], int l, int r, int x) 
+int BinarySearch(int arr[], int l, int r, int x) 
 { 
     if (r >= l) 
     { 
@@ -40,11 +40,11 @@ int binarySearch(int arr[], int l, int r, int x)
         // If element is smaller than mid, then it 
         // can only be present n left subarray 
         if (arr[mid] > x) 
-            return binarySearch(arr, l, mid-1, x); 
+            return BinarySearch(arr, l, mid-1, x); 
   
         // Else the element can only be present 
         // in right subarray 
-        return binarySearch(arr, mid+1, r, x); 
+        return BinarySearch(arr, mid+1, r, x); 
     } 
   
     // We reach here when element is not present 
@@ -58,7 +58,7 @@ int main(void)
    int arr[] = {2, 3, 4, 10, 40}; 
    int n = sizeof(arr)/ sizeof(arr[0]); 
    int x = 10; 
-   int result = exponentialSearch(arr, n, x); 
+   int result = ExponentialSearch(arr, n, x); 
    (result == -1)? printf("Element is not present in array") 
                  : printf("Element is present at index %d", 
                                                     result); 
