Everyone:
Next week, we will work on problems related to dynamic programming, which can be viewed as a combination of complete search and greedy algorithms. This technique will be necessary to solve Challenge 11 and Challenge 12.
The readings for this week are:
Competitive Programmer's Handbook
Chapter 7 Dynamic Programming
Once you have done the readings, answer the following Reading 06 Quiz questions:
To submit you work, follow the same process outlined in Reading 00:
$ git checkout master # Make sure we are in master branch $ git pull --rebase # Make sure we are up-to-date with GitHub $ git checkout -b reading06 # Create reading06 branch and check it out $ cd reading06 # Go into reading06 folder $ $EDITOR answers.json # Edit your answers.json file $ ../.scripts/check.py # Check reading06 quiz Checking reading06 quiz ... Q1 0.50 Q2 1.25 Q3 1.25 Score 3.00 / 3.00 Status Success $ git add answers.json # Add answers.json to staging area $ git commit -m "Reading 06: Done" # Commit work $ git push -u origin reading06 # Push branch to GitHub
Once you have committed your work and pushed it to GitHub, remember to create a pull request and assign it to the appropriate teaching assistant from the Reading 06 TA List.