Sign inSign in

Greedy algorithm

An algorithmic approach that makes the locally optimal choice at each stage with the intent of finding a global optimum.
as Robert Harle defines itUniversity of CambridgeThe wording closest to all 6 definitions
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.

Algorithm2Optimization2Action-value estimation1Algorithm design1Dynamic programming1Monte-Carlo evaluation1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • Erik Demaine & Srini Devadas

    MIT · Undergraduate

    An algorithmic strategy for optimization where choices are made step-by-step to maximize local benefit.
    • 5:55Course Overview, Interval Scheduling
  • Tom Leighton

    MIT · Undergraduate

    An algorithm that makes the locally optimal choice at each stage without backtracking or global optimization.
    • 48:45Graph Theory and Coloring
  • David Jerison

    MIT · Undergraduate

    An algorithm that tries to do the best possible at each stage.
  • David Silver

    Google DeepMind · Undergraduate

    An algorithm that always selects the action with the currently estimated highest value without exploring alternatives.
    • 23:42Exploration and Exploitation
  • Srini Devadas

    MIT · Undergraduate

    An algorithm that makes locally optimal choices at each step in the hope of finding a global optimum.
    • 35:05Dynamic Programming: Advanced DP

Lectures that assume it

10

Connections

24

The lectures that define it or assume it, and the concepts next to it.

6 lecturers. 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.