Fibonacci function using recursion

Question

0.00/5 (No votes)

See more:

The question is to print a fibonacci series using recursion. I am not getting output for the following code (I use pyCharm for running codes).

What I have tried:

Python

def fibo(n):
    if n==0 or n==1:
        return 1
    else:
        return fibo(n-2)+fibo(n-1)


fibo(6)

Posted 6-Jul-19 4:59am

Member 14517556

Updated 6-Jul-19 5:00am

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Thomas Daniels · Accepted Answer · 2019-07-06T05:01:00

Solution 1

The value is being calculated, but you are not doing anything with it - it's just getting discarded. You might want to print it on the console:

Python

print(fibo(6))

Posted 6-Jul-19 5:01am

Thomas Daniels

Comments

Member 14517556 6-Jul-19 11:23am

Thank you.

CPallini 6-Jul-19 11:56am

5.