Sign inSign in
ConceptSystems & CS

Order of growth

The rate at which the resource requirements of an algorithm grow as a function of the input size.
as Ana Bell 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 complexity1Evaluation model1Function1Input size1Program run time1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    • 53:45Big Oh and Theta Notation for Algorithmic Efficiency
  • Eric Grimson

    MIT · Undergraduate

    A way of measuring how much of a particular resource a process is going to take as it goes through its evolution.
    • 2:04Orders of Growth and Kinds of Procedures

Lectures that assume it

2

Connections

11

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

2 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.