Tuesday’s lecture topic was recursion. Thank goodness! I definitely understand the topic a lot better. I realized that defining a function is not
the same as a dictionary definition.
Recursion is more like a bunch of repeated steps based off of a smallest
case. It is kind of like mathematical
induction where you have a base case or smallest case, and then you try and get
to the next case (the n+1 case) (or vice versa). Recursion is a nice compact and fast way of
defining a function.
On Thursday we had the second term test. I think I did fairly well. I am so glad we went over recursion on
Tuesday, because it was apart of the coding question on the test!
No comments:
Post a Comment