ConceptTheory & Algos
Divide and conquer peak finder (Attempt 2)
A correct recursive 2D peak-finding algorithm that finds the global maximum of the middle column, compares its neighbors horizontally, and recurses on the appropriate half.
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.