ConceptTheory & Algos
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 grid by reducing the column space by half and scanning a column of size .
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.