Goal: 2 Tree 4 no reason.
1. Write a Netlogo procedure square n (non-reporting) to make a turtle draw a square of size n.
2. Write a Netlogo function sum n that takes an integer n, and calculates the sum of the numbers from 1 to n inclusive. Functions use (to-report)! (Remember the repeat x[ ] command!)
Notes: ( Diagrams and notes from class are on the board only ) sorry!
tree [ n s a ]
n : number of levels
s : length of each branch
a : angle of the split