CS130 - 3/11/2011

1. bad news
2. good news?
3. Evaluating potential solutions/algorithms *before* implementing (context matters!)
   1. Understand the problem
   2. Come up with an approach
   3. Come up with another approach
   4. Implement the better approach
      1. Top down or bottom up
         • Stepwise refinement
         • Building building blocks first.
      2. Thinking about how the loop will end before you start writing it
4. Task 1 - Squares. Initial situation: Ruby is at home with n cons in her bag and 1000 coins one block north. Final situation: Ruby is home at the corner of a NxN square (one coin per intersection).
5. Task 2 - Triangles. Just like task 1, but only the main diagonal and south and west of it.