You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/greedy_algorithms.md

320 B

Greedy Algorithms

Date: 04-07-22

Class: algorithms


Greedy algorithms are algorithms that always pick the best available option at the time, not looking at later consequences.

see also

list without id file.inlinks
where file.name = this.file.name

spanning_tree prims_algorithm