Greedy Algorithms Notes:
A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
- If trying to optimize on speed
, it may be useful to sort as a first step
A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
- If trying to optimize on speed
, it may be useful to sort as a first step