View the updated (and frankly, much better) article here:
It’s best to show how a Greedy algorithm works with an example.
Let’s say we have 3 coins:
10p
A tree T = (V, E) consists of a set of vertices (V) and a set of edges (E).
The vertices are the “Nodes” in a tree and the edges are the “lines connecting them”.
This is a tree:
“It’s written, ‘seek and ye shall find’. But first, ‘imagine what you…