Sign inSign in

Peak finding

An algorithmic problem of finding an element in an array that is greater than or equal to its immediate neighbors.
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.

Array2Inequalities1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Victor Costan

    MIT · Undergraduate

    A local peak is a number that is surrounded by numbers that are smaller or equal to it.
    • 32:48Asymptotic Complexity and Peak Finding (MIT 6.006, Recitation 1)

Connections

4

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.