Week 3 Exercises

[cooke99]

21/01:

• [x] Review notes on Greedy Algorithms from Week 3
• [x] Complete exercise 3-1
  • [x] Change naive solution to check all combinations.
• [x] 3-2
• [x] 3-3
  • [x] Comment and upload to git

22/01:

• [x] 3-4
• [x] 3-5
• [ ] 3-6
• [ ] 3-7

[cooke99]

Naive solutions that consider all combinations are harder to code than the greedy implementation.