Implement rotated_search and iterative exponential binary search functions #1391
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request adds two new features to the project:
1 - Implement rotated_search function:
Introduces a new function rotated_search in rotated_search.c for efficiently searching in rotated sorted arrays.
The function is implemented following the algorithm described in the GeeksforGeeks article linked in the file header.
Self-test cases are included to validate the correctness of the implementation.
2 - Implement iterative exponential binary search following C standard:
Adds an implementation of iterative exponential binary search in a separate commit.
The implementation adheres to the C standard and provides efficient searching capabilities.
Each commit is structured following the commit guidelines provided.