Skip to content

[pull] master from williamfiset:master#140

Merged
pull[bot] merged 4 commits intoUncodedtech:masterfrom
williamfiset:master
Apr 3, 2026
Merged

[pull] master from williamfiset:master#140
pull[bot] merged 4 commits intoUncodedtech:masterfrom
williamfiset:master

Conversation

@pull
Copy link
Copy Markdown

@pull pull bot commented Apr 3, 2026

See Commits and Changes for more details.


Created by pull[bot] (v2.0.0-alpha.4)

Can you help keep this open source service alive? 💖 Please sponsor : )

williamfiset and others added 4 commits April 2, 2026 21:36
Replace print-based void methods with generic List-returning methods.
Use incremental backtracking list instead of boolean[] used array.
Add overflow guard for n > 30 in the binary method. Update README
complexity from O(2^n) to O(n · 2^n). Add 9 JUnit 5 tests.

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Hybrid merge sort + insertion sort: splits array into runs of 32,
sorts each with insertion sort, then iteratively merges. Stable,
O(n log n) worst case, O(n) best case. Implements InplaceSort and
is integrated into the shared SortingTest.

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
@pull pull bot locked and limited conversation to collaborators Apr 3, 2026
@pull pull bot added the ⤵️ pull label Apr 3, 2026
@pull pull bot merged commit 69b49f7 into Uncodedtech:master Apr 3, 2026
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant