ConceptTheory & Algos
Greedy ascent algorithm
An algorithm for peak finding that iteratively moves in the direction of the greatest neighboring value until no larger neighbor is found.
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.