Recursion #

Recursion is a super difficult concept, but it’s vital to succeed in the rest of CS 61A. Here are a few resources that you could use to help practice recursion, and also understand the recursive leap of faith.

Easier + Moderate Questions; Resources for Recursion #

• Insect Combinatorics - Lab 03
  • Please take the time to understand this question, understand how the recursive leap of faith works with this question, and understand how
• My (Old) CS 61A Notes: Recursion
• My (Old) CS 61A Notes: Tree Recursion

Difficult (Exam-level) Questions #

• Recursive Leap of Faith Example - FA21 MT2 Q2b
  • Highly recommend watching this, or at least understanding how to do this! When I did this question for the first time while taking the exam, I think I finally understood what the recursive leap of faith meant; trusting that the function will eventually be correct, and just using the function definition to figure out what calling a smaller version of the case will do was seriously useful.
• Recursive Leap of Faith Example - SP22 MT2 Q4
  • If you can’t view the video, make sure you’re logged in to your berkeley.edu email.
  • This question is on the moderate side of difficulty compared to other recursive questions.
• Recursive Leap of Faith Example - SP22 MT2 Q5
  • If you can’t view the video, make sure you’re logged in to your berkeley.edu email.