Hassler Whitney created an ordered pair called a matroid to show that these methods are correct if they feature an underlying exchange argument.
Hassler Whitney created an ordered pair called a matroid to show that these methods are correct if they feature an underlying exchange argument. Typically, one may prove that these procedures are correct by considering a dynamic programming solution to a problem, then showing that there need be only one choice in each instance of a subproblem. These kinds of methods are exemplified by (*) Prim's algorithm and Kruskal's algorithm, both of which make minimum spanning trees. They are most often illustrated with a change-making algorithm. For 10 points, name these algorithms that always take the locally optimal step.
Hassler Whitney created an ordered pair called a matroid to show that these methods are correct if they feature an underlying exchange argument.
greedy algorithm