Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am trying to understand recursion in Scheme and I have a hard time doing the dry run for it, for example a simple Fibonacci number problem.
Could someone break down the steps in which the additions take place, for me?
(define (fib n)
(if (<= n 2)
1
(+ (fib (- n 1)) (fib (- n 2)))))
If you’re using Racket, as your tags indicate, then you have a built-in stepper.
Enter the program into DrRacket, and click Step in the top-right menu:
Then a stepper window will open up. Click Step over and over, and you can walk through the execution of the program.
If you want the number of steps to be a bit more manageable, pick a number lower than 10 for the execution to trace.