Greedy Algorithms are algorithms that make locally optimal choices at each step in the hope of eventually reaching the globally optimal solution Problems must exhibit two properties in order to implement a Greedy solution: Optimal Substructure An optimal solution to the problem contains optimal ...