Generating Fibonacci Series using Recursion: C Program

[@user-im5nu6wz8w]

Great one! I've searched several algorithms but none of them is this neat!

[@rohitraushan1273]

Thanks man. Im currently studying c language and your channel have been so much useful. 🤗🤗🤗

[@ty_b_32_ramkrushna_karnika25]

Yes I am also thank you bro

[@technotipDOTorg]

@Rohit and @Ramkrushna, really glad it's helping you. Please share this page with your friends too technotip.com/6086/c-programming-beginner-to-advance-to-expert/ Thank you ..

[@gopalsinghtanwar3162]

Your explanation are fantastic💥

[@technotipDOTorg]

Glad to hear that :)

[@Sake679]

Ok so I was really bin puzzle when reaching Fibbo(5),so it was when we did Fibbo(5-1) we got Fibbo(4) which became calling function of Fibbo(4-1) and Fibbo(4-2) which gave (1+1) and then we went back to our function call Fibbo(5) to do then next operation of Fibbo(5-2) which was 3 and returned 1, therefore we got 3. Thank you for simple explanation

[@kalebakeitshokile1366]

Yea so you’re basically generating a tree with each recursive call and summing the ones at the ends

[@ty_b_32_ramkrushna_karnika25]

Nice

[@technotipDOTorg]

Thank you ..