The typical steps of greedy algorithm

1.Cast the optimization problem as one in which we make a choice and are left with one subproblem to solve. 2.Prove that there is always an optimal solution that makes the greedy choice, so that the g

>>阅读原文<<