Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Python

self learner
self learner
1,556 Points

Help me with this fibonacchi sequence pls

In line 7 when the function returning "return fibonacci(n-1) + fibonacci(n-2)", does the -1 and -2 referring the previous two numbers?

def fibonacci(n):
    if n == 1:
        return 1
    elif n == 2:
        return 1
    elif n > 2:
        return fibonacci(n-1) + fibonacci(n-2)

1 Answer

Steven Parker
Steven Parker
229,788 Points

That's exactly right. This is an example of recursion, where the function calls itself with a modified argument. This continues down until the value reaches 2 (or 1) when it begins returning the values back.

self learner
self learner
1,556 Points

I guessed so, just wanted to confirm. Thanks