1 KiB
1 KiB
| slug | title | author | order |
|---|---|---|---|
| /silver/greedy | Greedy Algorithms | Darren Yao | 1 |
Greedy algorithms are algorithms that select the optimal choice at each step instead of looking at the solution space as a whole. This reduces the problem to a smaller problem at each step.
Tutorials
- Intro to USACO, Chapter 9
- Interval Cover
- CPH 6
- CPC.5
Problems
USACO
Misc