Sign inSign in

Running time of 2D peak finding

The overall running time of the 2D peak finding algorithm using maximum finding is Θ(Mlog⁡N)\Theta(M \log N).
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.

Master theorem or tree method1Recurrence relation1

Lecturers

1

    Connections

    2

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

    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.