Find nth fibonacci no. using recursive technique. | GeeksforGeeks

preview_player
Показать описание

This video is contributed by Anmol Aggarwal.

Please Like, Comment and Share the Video among your friends.

Install our Android App:

If you wish, translate into local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
Рекомендации по теме
Комментарии
Автор

This video literally cleared all my confusion regarding recursion. The dry run killed every but of my confusion about how recursion works. Thank you !!

aaravbansal
Автор

not helpful at all
did'nt understand it

RogueCyber
Автор

I was confused about how recursion worked until I saw this, many thanks!

elliotlichtenberg
Автор

Thrilled to see if there is a more efficient recursive method to find it.

jimmymesa
Автор

Dynamic programming with this would save you from calculating fibonacci of same number multiple times

khushitshah
Автор

So according to this program fibonacci series has changed. really confusing i think you are wrong

sambalryder
Автор

This will give segmentation fault if the value of n is too large

indianweeboo
Автор

Kindly FYI you are wrong with the answer at the end of the video.. Error: You said the Fib(5) is 3 right answer: Fib(5) is 5

HenryBuild-spor
Автор

Help help help.. If I put n=50 the time complexity increased exponentially how to reduce it??

arunabhadutta
Автор

You should also show output of the code running in IDE

AnkitKumar-jmcz
Автор

After making some changes it started but. Only showing last no. Of series as output

AnkitKumar-jmcz
Автор

The code shown is not working it should be -->

int fibonacci(int n)
{

if(n==0)
return 0;
if(n==1)
return 1;

return
}

for n=5, it returns 5

ThePratyushkr
Автор

not helpful at all
did'nt understand it

chiragtamrakar
join shbcf.ru