Sign inSign in

Amortized analysis

An analysis technique where we bound the total cost of a sequence of operations rather than the individual running time of each operation.
as Erik Demaine & Srini Devadas defines itMITThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Algorithm complexity1Asymptotic notation1Worst-case analysis1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Graduate

    A method to bound the average cost of an operation over a sequence of operations.
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    An analysis method where you bunch up steps rather than timing every single step individually.
    • 27:01Hierarchy Theorems (Time, Space, and Nondeterministic)

Lectures that assume it

13

The first 12 are shown.

Connections

22

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.