Update and rename Binary_search.cpp to Update BinarySearch.md #340
Conversation
This file contains 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
— Time complexity remains O(log n). — Recursive approach uses extra space: O(log n) due to call stack. — Iterative approach preferred for space optimization: O(1) space complexity.
panditakshay402
requested changes
Oct 12, 2024
There was a problem hiding this comment.
@Ruksina01 kindly Follow Rules from Readme.md to get you PR merged.
|
@panditakshay402 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
— Optimized binary search algorithm for both time and space complexity.
— Time complexity: O(log n) for efficient element search in a sorted array.
— Space complexity: Recursive approach incurs O(log n) space due to recursion stack.
— Optimization: Iterative version preferred for space efficiency with O(1) space complexity.