feb 8

go over O(n) homework

• ../homework/feb8

start brute force chapter

• Discuss
  • selection sort
  • bubble sort
  • sequential search
  • brute-force string match
  • closest pair
  • convex-hull
  • traveling salesman
  • knapsack problem
• looping over all permutations ... we'll worry about later
• typical idea throughout is to search every possibility ... which often blows up exponentially