• decomposing problem
• base case
• recursive case which gets closer to solution
• Factorial
  • n! = n * (n-1)!
  • 0! = 1

• Raw multiplications
  • X^N = X * X * X * ... * X
  • N-1 multiplications
  
  
  

• Save work; clump things together
  • SX = X * X
  • X^N = SX * SX * ... * SX
  • roughly N/2 times ...

• Refine this latter approach

• Base case: X^0 = 1.0
• N is even case: X^N = X^(N/2) * X^(N/2)
• N is odd case: X^N = X * X^(N/2) * X^(N/2)

Covered part of Java lets you solve all kinds of algorithms

• Canvas class
• Graphics class
• pixels
• Coordinates

• void drawLine(int x1, int y1, int x2, int y2)
• void drawRect(int x, int y, int width, int height)
• void drawOval(int x, int y, int width, int height)
• fill versions
• void setColor(Color c)

• void drawString(String s, int x , int y)
• Setting colors
  Color blah; blah = newColor(100, 100, 100);