This repository contains implementations of several popular searching algorithms in python, including:
- Binary search
- Exponential search
- Fibonacci search
- Interpolation search
- Jump search
- Linear search
- Ternary search
Each algorithm is implemented in its own separate python file, with a brief description of how it works and its time complexity.
You can use the provided test cases to check the correctness of your implementation and also you can test with your own test cases.
Please feel free to open an issue if you have any questions or suggestions.
For better understanding and implementation, please read the comments provided in the code.
| Searching Method | Time Complexity | ||||
|---|---|---|---|---|---|
| Binary Search | O(log n) | ||||
| Exponential Search | O(log n) | ||||
| Fibonacci Search | O(log n) | ||||
| Interpolation Search | O(log log n) | ||||
| Jump Search | O(sqrt(n)) | ||||
| Linear Search | O(n) | ||||
| Ternary Search | O(log n) |