Computing the Fibonacci Sequence | C Programming Example

[@justcurious1940]

Thanks for the explanation , Recursion is hard for new programmers : // Iterative solution void Fibonacci_Iterative (int Sequence_Length){ int first = 0, second = 1, third; printf("%d,%d,",first,second); for(int i = 2 ; i < Sequence_Length ; i++){ third = first + second; printf("%d",third); first = second; second = third; if(i != Sequence_Length-1) printf(","); else printf(" "); } } // Recursive solution int Fibonacci_Recursion(int Position){ if(Position > 1) return Fibonacci_Recursion(Position - 1) + Fibonacci_Recursion(Position - 2); if(Position == 0) return 0; if(Position == 1) return 1; printf("Invalid position !! "); return -1; }

[@chal7z]

you're such a great teacher !. Your videos are really helpful, tysm!!

[@maniyaa_]

Great video! thank you for the clear and logical explanation :)

[@PortfolioCourses]

You’re welcome Marley! :-)

[@miarayokik.s.h8941]

Ooooh that's really understandable... Thank youuuuu 💕

[@PortfolioCourses]

You’re welcome! :-)

[@chinni949]

sir are these programs helpful for campus recruitments

[@abdoTheDS]

anyone that did not get how that recursion function works. use a pen and paper ✅

[@rakshaya518]

Not working for 48 the values are going in negative

[@PortfolioCourses]

At a certain point the number is so big that it essentially can’t be represented accurately by the type. If you change the type to size_t it should work for larger numbers as size_t can represent a larger range of positive integer values.

[@Abdalrahman_0]

I think that I did it better void fun (int x){ int y= x, i ; printf("%d ", x); printf("%d ", x+=1); for(i = 0;i < 10;i++){ y= (x+y); printf("%d ", y); x= (x+y); printf("%d ", x); } } ------------->The main int main(void) { int x; printf("Enter a #: "); scanf("%d", &x); fun(x); return 0; } + Thank u so much❤❤

[@PortfolioCourses]

Thanks for sharing your solution! :-)