feat: add Heap Sort algorithm (Phase 6) - #14
Merged
Conversation
- Add src/sorting/heap_sort.py implementing in-place binary max-heap construction and repeated root-extraction sorting, guaranteeing O(n log n) worst-case time with O(1) auxiliary space. - Add Heap Sort tests to tests/test_sorting.py covering typical, boundary, pre/reverse-sorted, duplicate, and non-mutation scenarios, with full coverage. - Expose Heap Sort via the service layer: sort_heap_sort wrapper in service/tools.py, MCP tool, and POST /sorting/heap-sort endpoint, each with corresponding tests. - Add ADR 0018 documenting the binary max-heap design vs. Quicksort and Merge Sort trade-offs. - Update README and ROADMAP; first Phase 6 item.
sjamal
added a commit
that referenced
this pull request
Aug 23, 2026
- Add src/sorting/heap_sort.py implementing in-place binary max-heap construction and repeated root-extraction sorting, guaranteeing O(n log n) worst-case time with O(1) auxiliary space. - Add Heap Sort tests to tests/test_sorting.py covering typical, boundary, pre/reverse-sorted, duplicate, and non-mutation scenarios, with full coverage. - Expose Heap Sort via the service layer: sort_heap_sort wrapper in service/tools.py, MCP tool, and POST /sorting/heap-sort endpoint, each with corresponding tests. - Add ADR 0018 documenting the binary max-heap design vs. Quicksort and Merge Sort trade-offs. - Update README and ROADMAP; first Phase 6 item.
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 in-place binary max-heap based Heap Sort, guaranteeing O(n log n) worst-case time with O(1) auxiliary space, exposed through the existing MCP/HTTP service layer as well as src/, with full test coverage and ADR 0018. First Phase 6 item.