ConceptTheory & Algos
Greedy ascent algorithm (2D)
A 2D peak-finding algorithm that moves to neighboring elements with larger values, resulting in a worst-case complexity of .
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 definition1Worst-case complexity1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.