The Runtime Theory

topic / complexity-and-analysis

Complexity and Analysis

Explain how algorithm work grows with input size.

Study asymptotic bounds, best and worst cases, amortized cost, recurrences, and the limits of using complexity alone to predict elapsed time.

1 article · 1 video · 1 trace · 1 request flow · 1 interview · 5 total

Articles

complexity and analysisSep 25, 2026

A Practical Method for Analyzing Algorithms

An analysis begins by naming the input size and the operation whose growth matters.

Request Flows

request flow · 5 stagesHow A Practical Method for Analyzing Algorithms worksAn interactive concept flow for a practical method for analyzing algorithms, from its assumptions through the main operation and boundary checks.

Videos

complexity and analysisSep 25, 2026

Video lesson: A Practical Method for Analyzing Algorithms

Recording brief and narration plan for a visual lesson on a practical method for analyzing algorithms.

Traces

trace 01 · runtimeTrace: A Practical Method for Analyzing AlgorithmsFollow the key state changes and boundary checks involved in a practical method for analyzing algorithms.

Interviews

medium · t2Explain A Practical Method for Analyzing AlgorithmsExplain the model, execution steps, complexity, and limits of a practical method for analyzing algorithms.

Explore adjacent

programming algorithms

New lessons by email

Get new explanations about complexity and analysis and related systems in your inbox.

One technical dispatch per week. No noise.