feat: add Binary Search algorithm (Phase 6) - #15
Merged
Conversation
- Add src/searching/binary_search.py implementing iterative midpoint bisection over a sorted array, guaranteeing O(log n) worst-case time with O(1) space. - Add tests/test_searching.py covering present-value lookups (first, middle, last), absent values, empty array, and single-element array cases, with full coverage. - Expose Binary Search via the service layer: search_binary_search wrapper in service/tools.py, MCP tool, and POST /searching/binary-search endpoint, each with tests. - Add ADR 0019 documenting the iterative bisection design. - Expand ROADMAP: add Binary Search to Phase 6 (Completed), and add new Phase 7 (BFS, DFS, Kruskal's) and Phase 8 (PageRank, Fast Inverse Square Root) based on discussion of additional candidates.
sjamal
added a commit
that referenced
this pull request
Aug 23, 2026
- Add src/searching/binary_search.py implementing iterative midpoint bisection over a sorted array, guaranteeing O(log n) worst-case time with O(1) space. - Add tests/test_searching.py covering present-value lookups (first, middle, last), absent values, empty array, and single-element array cases, with full coverage. - Expose Binary Search via the service layer: search_binary_search wrapper in service/tools.py, MCP tool, and POST /searching/binary-search endpoint, each with tests. - Add ADR 0019 documenting the iterative bisection design. - Expand ROADMAP: add Binary Search to Phase 6 (Completed), and add new Phase 7 (BFS, DFS, Kruskal's) and Phase 8 (PageRank, Fast Inverse Square Root) based on discussion of additional candidates.
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Adds an iterative Binary Search over sorted arrays, exposed through the existing MCP/HTTP service layer as well as src/, with full test coverage and ADR 0019. Also expands ROADMAP.md with new Phase 7 (BFS/DFS/Kruskal's) and Phase 8 (PageRank, Fast Inverse Square Root).