Today, we learned about recursion. Recursion is really confusing, but I find it helps to trace recursive code through smaller examples to understand how it works. Recursion is like inception, because you have a function being called within itself repeatedly untill a base case is reached and then it can evaluate all of the previous function calls.
Here's a witty picture because that's what all the cool kids do. This week I stalled on my squats, so I have to deload... sucks. Atleast I lift unlike the majority of the people in this school.
In other news, we talked about Assignment #1 in class today, it's the Tower of Hanoi problem except with another peg. And the rings are represented by cheeses and pegs by stools. Seems like a very interesting problem, although the starter code is very mysterious looking.
Here's a witty picture because that's what all the cool kids do. This week I stalled on my squats, so I have to deload... sucks. Atleast I lift unlike the majority of the people in this school.
In other news, we talked about Assignment #1 in class today, it's the Tower of Hanoi problem except with another peg. And the rings are represented by cheeses and pegs by stools. Seems like a very interesting problem, although the starter code is very mysterious looking.
No comments:
Post a Comment