Skip to content

Latest commit

 

History

History
16 lines (14 loc) · 788 Bytes

greedy.md

File metadata and controls

16 lines (14 loc) · 788 Bytes

Greedy Algorithms

Here are some problems can be solved using a greedy strategy. A greedy approach takes the best action immediately at each step; thus it is fast. However, it may not always yield the correct result since the algorithm can be "short-sighted" and produce a suboptimal answer. When solving those problems, we need to convince ourselves the correctness of the greedy algorithms.

Medium

Medium to Hard