Update binary_search.py #778
Closed
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.
Optimizations:
Removed unnecessary initialization of mid before the loop. Avoid redundant comments that describe well-known binary search logic. Eliminated extra arithmetic operation in mid = low + (high - low) // 2 since (low + high) // 2 is sufficient in Python (no integer overflow issues like in C++). Direct comparison of nums[mid] == target before handling left/right half updates.