Skip to content
  1. CLRS-Lean
  2. Chapters 1–35 · CLRS Fourth Edition
  3. Chapter 2. Getting Started
  4. 2.2. Analyzing Algorithms
  5. 2.2. Insertion-Sort Line Costs
Browse chapters
Imports
import CLRSLean.FourthEdition.Chapter_02.Section_02_2_Analyzing_Algorithms.LineCost.Definitions import CLRSLean.FourthEdition.Chapter_02.Section_02_2_Analyzing_Algorithms.LineCost.Formula import CLRSLean.FourthEdition.Chapter_02.Section_02_2_Analyzing_Algorithms.LineCost.BestWorst

CLRS Section 2.2 - Insertion-sort line costs

Stable facade for the symbolic line costs, exact execution-count table, complete running-time equation, and best/worst trace specializations.

Implementation details