• CS 111.03 - Winter 2020
  • Announcements
  • Schedule
  • Assignments
  • Project
  • About

Lesson 22: Hard problems and greedy solutions

26 February, 2020

Outline:

  1. Review of inheritance
  2. Mini-quiz
  3. Recap of lambda and sorting given a key function
  4. Bin Packing
    • “hard” problems and algorithmic complexity
  5. The Knapsack Problem
    • “greedy” solutions
    • algorithmic complexity, revisited
  6. Recap for Quiz 4

Reading assignment (to be completed by the next class):

  • recommended: https://en.wikipedia.org/wiki/Bin_packing_problem
  • recommended: https://en.wikipedia.org/wiki/Knapsack_problem