1. CLRS-Lean
  2. CLRS Fourth Edition
  3. Chapter 26. Parallel Algorithms
  4. 26.2-26.3. Multithreaded Algorithms (Historical 2_4 Compatibility)
  5. 26.3. Parallel Merge
  6. 26.3. P-MERGE — Costs
  7. 26.3. P-MERGE Costs — Quadratic-Log Span
Imports
import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMerge.Costs.Span.Envelope import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMerge.Costs.Span.Bounds import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMerge.Costs.Span.WitnessLists import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMerge.Costs.Span.LowerBound

CLRS Chapter 26.3 — P-MERGE Span

This navigation module collects the three-quarter envelope, its pointwise quadratic-logarithmic upper bound, and the matching interleaved lower witness.