Repository navigation
Conversation
huffman: binary heap keyed [weight,min-leaf,id], no per-merge re-sort. offline_caching: eviction scans cache once, no per-eviction sort. offline_minimum: binary search for first extract after insert. approx_agreement: sort once per round, hoist trimmed mean. cpu_scheduling: RR ready queue via head index + amortized compaction. distance_vector: on-demand poison-reverse lookup, no N^3 table. pl_resolution: hash-set clause membership instead of linear scan. prufer: sorted-set min-leaf heap for encode and decode. AI-Tool: Muse Code (Meta Muse Spark)
Collaborator
Author
|
Superseded by #45 — all four area branches merged into one batch PR. |
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
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.
Part of #39 — the eight remaining time-complexity items across dp,
data_structure, distributed, systems, search, combinatorics.
Changes
dp/huffman/huffman: binary heap, no per-merge re-sort(n=30000: 17.00s → 0.74s).
dp/offline_caching/offline_caching: reduce-over-set eviction, noper-eviction sort (k=1000/m=40000: 7.95s → 2.10s).
data_structure/offline_minimum/solution: binary search for firstextract after insert (m=30000: 7.45s → 2.10s).
distributed/consensus/approx_agreement/approx_agreement: sortonce/round + hoisted mean (2.70s → 0.69s).
systems/cpu_scheduling/solution: round-robin head-index queue withamortized compaction, no
vec(rest)copies (7.42s → 0.55s).systems/distance_vector_routing/solution: on-demand poison-reverselookup, no N³ table (N=200: 2.59s → 0.77s).
search/pl_resolution/pl_resolution: hash-set clause membership(19.72s → 2.65s).
combinatorics/prufer/prufer: sorted-set min-leaf heap forencode+decode (decode n=15000: 1.60s → 0.60s).
Validation
scale cases, each before (HEAD) vs after via JVM
clojure.main:all outputs byte-identical, all scale runs faster. Shared GPG cases
unavailable locally — CI covers them.
AI-Tool: Muse Code (Meta Muse Spark)