Summarising How to Think Like a Computer Scientist
Runestone in social media:
Follow @iRunestone
Help support us:
Table of Contents
Book Index
Scratch ActiveCode
Join a Study Group
Group Schedule
Schedule New Chapter
Manage Group
Instructor's Page
Progress Page
Edit Profile
Change Password
Register
Login
Navigation Help
Help for Instructors
About Runestone
Report A Problem
Fibonacci
ΒΆ
Run
Save
Load
def fib(n): if n == 1: return 1 elif n == 0: return 0 else: return fib(n-1) + fib(n-2) print(fib(10))
(chrec_fib)
(chrec_fib_codelens)
Next Section - The Three Laws of Recursion