Skip to content

Improve binary search documentation and explanation. #14271

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
avneeshkumar31311-cyber wants to merge 2 commits into from
Closed

Improve binary search documentation and explanation. #14271

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4741115
Improve binary search documentation by adding basic explanation.
avneeshkumar31311-cyber Feb 14, 2026
b610030
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 14, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions searches/binary_search.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,12 @@
"""
Pure Python implementations of binary search algorithms

Basic Idea:
Binary Search works by repeatedly dividing the search interval in half.
If the target value is smaller than the middle element, the search continues
in the left half. Otherwise, it continues in the right half.
This process repeats until the element is found or the interval becomes empty.

For doctests run the following command:
python3 -m doctest -v binary_search.py

Expand Down
Loading