Sign inSign in

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.
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 definition1Binary search1Recursion1

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.