Week 4

So this week was basically more on recursion. It must be a pretty big topic for it to need more than a week's worth of lecture. I was pretty fascinated when I ran tree_burst.py; the arrows moving, turning and leaving trails was pretty cool. I think that a program like this could be useful when drawing diagrams or making charts. When I saw the M(n) function for recursion though, I was overwhelmed. I don't know if I'm ever going to be familiar with that formula; it's way too long and complicated! The way we trace recursion though was something new to me, something I didn't learn in high school but it looks pretty handy. Mr. Heap was right when he said that simply plugging in values would save time