✨ Refactor Search Algorithms and Add Test Cases for Edge Cases and Performance

I'm expecting a level3 for this PR! and assign me! @UTSAVS26

Changes made:

1. Jump_search.py:

2. Linear_Search.py:

Optimized the linear_search function with logging for detailed step tracking.
The function now handles edge cases, including empty arrays and single-element lists.

3. Recursive_binary_search.py:

Implemented logging within the binary_search_recursive function to track recursive calls and decisions at each step.
Improved error handling for situations when the target is absent from the array.

4. Ternary_search.py:

Integrated logging in the ternary_search function to trace the algorithm's mid-point calculations and recursion steps.
Added handling for edge cases such as empty arrays and lists with a single element.

5. Linear_search.py:

6. Exponential_search.py:

Improved logging to track search boundaries and the progression of the algorithm.
Implemented better error handling for absent targets and edge cases like empty arrays.

7. Fibonacci_search.py:

Added logging for Fibonacci sequence generation and target search.
Optimized the function for handling arrays with fewer elements and edge cases like empty arrays.

8. Interpolation_search.py:

Updated the algorithm to provide debugging logs during the interpolation process.
Handled edge cases where interpolation search may not be appropriate (e.g., non-uniformly distributed arrays).

9. Iterative_binary_search.py:

Enhanced with logging for detailed step-by-step analysis of binary search operations.
Provided error handling for edge cases like empty arrays.

UTSAVS26 / PySnippets