Welcome to the Treehouse Community

The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.

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
221,450 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