Sign inSign in

2D peak finding recurrence relation

The complexity recurrence relation T(n, m) = T(n, m/2) + θ(n) describes the time to find a peak in an n×mn \times m grid by reducing the column space by half and scanning a column of size nn.
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.

2D peak finding algorithm1Big Theta notation1Recurrence relation1

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    1 lecturer. 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.