Overview
This release introduces two new search algorithms to the `algods` package: Jump Search and Interpolation Search. These algorithms complement the existing Linear and Binary Search functions, offering more options for efficient searching based on different use cases.
Key Updates
- **Jump Search**: An algorithm that efficiently searches sorted arrays by jumping ahead by fixed steps, then performing a linear search within the identified block.
- **Interpolation Search**: A more advanced search algorithm for uniformly distributed sorted arrays, which estimates the position of the target value based on the value of the elements.
Improvements
- Updated README.md to include documentation for the new search algorithms.
- Added type annotations to all functions for better code clarity and type safety.