Update 1_Silver_Greedy.md
This commit is contained in:
parent
2fedf46cb9
commit
c99c5cac0c
1 changed files with 12 additions and 4 deletions
|
@ -1,12 +1,20 @@
|
|||
---
|
||||
slug: /silver/greedy
|
||||
title: "Greedy"
|
||||
author: Unknown
|
||||
author: Darren Yao
|
||||
order: 1
|
||||
---
|
||||
|
||||
See 9 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a
|
||||
# Greedy Algorithms
|
||||
Greedy algorithms are algorithms that select the most 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.
|
||||
|
||||
- CPH 6
|
||||
# Tutorials
|
||||
- Intro to USACO, Chapter 9: [Java](http://darrenyao.com/usacobook/java.pdf) [C++](http://darrenyao.com/usacobook/cpp.pdf)
|
||||
- CPH Chapter 6
|
||||
|
||||
<!-- END DESCRIPTION -->
|
||||
# Problems
|
||||
- [USACO Why Did the Cow Cross the Road](http://www.usaco.org/index.php?page=viewproblem2&cpid=714)
|
||||
- [USACO Rest Stops](http://www.usaco.org/index.php?page=viewproblem2&cpid=810)
|
||||
- [USACO High Card Wins](http://usaco.org/index.php?page=viewproblem2&cpid=571)
|
||||
|
||||
<!-- END DESCRIPTION -->
|
||||
|
|
Reference in a new issue