Everyone:
Next week, we will work on problems related to greedy algorithms, which is a problem solving approach where we attempt to find a global optimum by always making the locally optimal choice, and bit manipulation. These techniques will come in handy for solving Challenge 09 and Challenge 10.
The readings for this week are:
Competitive Programmer's Handbook
Chapter 10 Bit manipulation
Chapter 6 Greedy Algorithm
Once you have done the readings, answer the following Reading 05 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 reading05 # Create reading05 branch and check it out
$ cd reading05 # Go into reading05 folder
$ $EDITOR answers.json # Edit your answers.json file
$ ../.scripts/check.py # Check reading05 quiz
Checking reading05 quiz ...
Q1 1.00
Q2 1.00
Q3 0.50
Q4 0.50
Score 3.00 / 3.00
Status Success
$ git add answers.json # Add answers.json to staging area
$ git commit -m "Reading 05: Done" # Commit work
$ git push -u origin reading05 # 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 05 TA List.