Sign inSign in
ConceptSystems & CS

Big O notation

A mathematical notation used to describe an upper bound on the growth of a function.
as Ana Bell defines itMITThe wording closest to all 7 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.

Asymptotic analysis3Function3Limit3Asymptotic growth2Inequalities2Algorithm analysis1Algorithm efficiency1Graph plotting1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Undergraduate

    A mathematical representation of an upper bound on the number of steps an algorithm takes as a function of the input size.
  • Tom Leighton

    MIT · Undergraduate

    A mathematical notation used to describe the limiting behavior of a function, ignoring constant factors and lower-order terms.
    • 50:51Sums and Asymptotics
  • Steven Strogatz

    Cornell University · Undergraduate

    A mathematical notation used to describe the order of magnitude of terms being neglected.
    • 11:19MAE5790-2 One dimensional Systems
  • Michael Sipser

    MIT · Undergraduate

    A notation used to describe the upper bound of a function's growth rate, ignoring constant factors.
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A mathematical notation that describes the limiting behavior of a function, used to bound a function from above by another simpler function up to a constant factor.
    • 1:15Big O and friends

Lectures that assume it

34

The first 12 are shown.

Connections

50

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

Concepts9

Show 3 more

Lectures41

Show 35 more

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