[FEATURE] Add Jump Search Algorithm Implementation in R #216
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
There was a problem hiding this comment.
Pull Request Overview
This PR introduces a comprehensive implementation of the Jump Search algorithm in R using the R6 object-oriented framework. Jump Search is an efficient searching technique for sorted arrays that achieves O(√n) time complexity by jumping ahead in fixed steps and then performing linear search within identified blocks.
- Complete R6 class implementation with proper validation and error handling
- Educational demonstration function with multiple examples and performance analysis
- Comprehensive documentation with algorithm explanation and usage examples
Co-authored-by: Copilot <[email protected]>
Co-authored-by: Copilot <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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 PR introduces an educational and well-documented implementation of the Jump Search Algorithm in R using the R6 OOP framework. Jump Search is an efficient searching technique for sorted arrays, achieving a time complexity of O(√n) — faster than linear search and simpler than binary search.
Complexity:
• Time Complexity: O(√n)
• Space Complexity: O(1)