CS241: Spring 2017 -- Theta, n^2 sorts, and Fibonacci

1. Quiz - uh-oh...
   1. What's pseudo-code?
   2. problem/algorithm/design (OOD/GUI)/implementation/debugging
   3. How to determine O(f(n)) for a given algorithm?
   4. Counting repetitions in bubble sort; how to?
   5. Two more n^2 sorts: insertion and selection
   6. the quiz Thurs will be on the three n^2 sorts and the definition of O
2. Conway's leftovers
   1. Running until the state is constant, or alternating
   2. GUI input/editing of the current Life configuration
      1. mousePressed and getX(), getY()
      2. converting pixels to row and columns
3. You can trade space for time (and vice-versa). E.g. calculating Fibonacci numbers.
4. Problem: evaluate an arbitrary infix expression.