Added type hints and doctests for binary_search and exponential_search functions. Improved code documentation and ensured testability.

Author: whyvineet

searches/Exponential_Search.py

@@ -1,9 +1,24 @@
-# Python program to perform Exponential Search
-from bisect import bisect_left
+from typing import List
 
+def binary_search(arr: List[int], left: int, right: int, target: int) -> int:
+    """
+    Perform binary search on a sorted array.
 
-# Binary search function
-def binary_search(arr, left, right, target):
+    Parameters:
+    arr (List[int]): The sorted list in which to search.
+    left (int): The starting index for the search range.
+    right (int): The ending index for the search range.
+    target (int): The value to search for.
+
+    Returns:
+    int: The index of the target if found, otherwise -1.
+
+    Doctest:
+    >>> binary_search([2, 3, 4, 10, 40], 0, 4, 10)
+    3
+    >>> binary_search([2, 3, 4, 10, 40], 0, 4, 5)
+    -1
+    """
     while left <= right:
         mid = left + (right - left) // 2
         if arr[mid] == target:
@@ -15,8 +30,27 @@ def binary_search(arr, left, right, target):
     return -1
 
 
-# Exponential search function
-def exponential_search(arr, target):
+def exponential_search(arr: List[int], target: int) -> int:
+    """
+    Perform exponential search on a sorted array.
+
+    Exponential search first finds a range where the target may reside
+    by repeatedly doubling the index. It then performs binary search
+    within that range.
+
+    Parameters:
+    arr (List[int]): The sorted list in which to search.
+    target (int): The value to search for.
+
+    Returns:
+    int: The index of the target if found, otherwise -1.
+
+    Doctest:
+    >>> exponential_search([2, 3, 4, 10, 40, 50, 60, 70, 80, 90, 100], 10)
+    3
+    >>> exponential_search([2, 3, 4, 10, 40, 50, 60, 70, 80, 90, 100], 5)
+    -1
+    """
     n = len(arr)
 
     # If the target is at the first position
@@ -32,8 +66,10 @@ def exponential_search(arr, target):
     return binary_search(arr, i // 2, min(i, n - 1), target)
 
 
-# Example usage
 if __name__ == "__main__":
+    """
+    Example to demonstrate the usage of exponential_search function.
+    """
     arr = [2, 3, 4, 10, 40, 50, 60, 70, 80, 90, 100]
     target = 10