| Saint Louis University | 
    Computer Science 144 | Dept. of Math & Computer Science | 
Text's 	recursiveCircles.pde
 
Text's 	recursiveBoxes.pde
 
Text's 	recursiveTree.pde or
recursiveTreeTransform.pde
 
Challenge: Sierpinski's Triangle (2 variants)
 
The second version differs by filling in the smallest set of
triangles in black (and it goes one level deeper in the recursion).
