Imports
import CLRSLean.Chapter_16
import CLRSLean.FourthEdition.Chapter_15.Section_15_1_Activity_Selection
import CLRSLean.FourthEdition.Chapter_15.Section_15_2_Greedy_Meta
import CLRSLean.FourthEdition.Chapter_15.Section_15_3_Huffman_Codes
import CLRSLean.FourthEdition.Chapter_15.Section_15_4_Offline_CachingChapter 15 — Greedy Algorithms
This is the canonical CLRS fourth-edition chapter guide during the migration period.
Current source
Sections 15.1--15.3 are native fourth-edition sections (activity selection,
the greedy-choice/optimal-substructure meta-theorems, and Huffman codes),
imported directly from
Section 15.1,
Section 15.2,
and
Section 15.3.
Declarations keep their legacy namespaces (CLRS.ActivitySelection,
CLRS.GreedyMeta, CLRS.HuffmanV2); the third-edition-numbered imports
CLRSLean.Chapter_16 and CLRSLean.Chapter_16.Section_16_* forward to
these sources during the compatibility period.
Coverage boundary
Section 15.4 (offline caching) is a native fourth-edition section. Its finite
cache model, farthest-in-future policy, legal-trace exchange construction, and
public optimality theorem CLRS.Caching.fifo_optimal complete CLRS Theorem
15.5 for every nonempty initial cache and finite request sequence. It is
imported through
Section 15.4.
The section is split into the sub-modules:
This completion is at the mathematical cache-policy level. Pointer/RAM implementations and hardware caching costs remain optional refinements outside the advertised theorem boundary.
The third-edition Sections 16.4 (matroids) and 16.5 (task scheduling) are
retained as supplementary online material (reachable through
CLRSLean.OnlineMaterial).
See docs/clrs-fourth-edition-map.csv for the section-level mapping and
docs/migrations/clrs4.md for compatibility and deprecation policy.