This repository has been archived on 2022-06-22. You can view files and clone it, but cannot push or open issues or pull requests.
usaco-guide/content/4_Silver/2_Silver_Greedy.md
2020-06-15 16:19:07 -07:00

1 KiB

id title author
greedy Greedy Algorithms Darren Yao

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