DAA HT23, Greedy algorithms

Created: March 23, 2023 | Read markdown | About these notes | View in context | Study these flashcards |

Course - Design and Analysis of Algorithms HT23^U

Flashcards

What behaviour characterises greedy algorithms?

greedy-algorithm-definition-daa

The solution is constructed step by step, and at each step the algorithm makes the choice that offers the greatest immediate benefit.

Course - Design and Analysis of Algorithms HT23^U

(outgoing)
Lecture - DAA HT23, XIII^U

(incoming)
Lecture - DAA HT23, XIV^U

(incoming)
Lecture - DAA HT23, XII^U

(incoming)
Lecture - DAA HT23, XV^U

(incoming)
Lecture - DAA HT23, XI^U

(incoming)
Notes - Imperative Programming HT23, Priority queues^U

(sim: 0.599)