Problem:
Generating Fibonacci series using only one variable.
There are many ways to achieve this. I have given three ways to do this in the following methods.
Method #1:
We can have a simple function to do this.
Method #2:
The following recursive function would do the job.
Method #3:
The following one works great as well!
Cheers!!
Jack
4 comments:
can u plz explain hw dis code is working??????????
The logic is to store both (n-2)th value in MSB & (n-1)th value in LSB of a single variable.
So, the iterations will take place as like,
i = (0,1) => 0000 0000 0000 0000 | 0000 0000 0000 0001
= (1,1) => 0000 0000 0000 0001 | 0000 0000 0000 0001
= (1,2) => 0000 0000 0000 0001 | 0000 0000 0000 0010
= (2,3) => 0000 0000 0000 0010 | 0000 0000 0000 0011
The while loop just checks the limit of an integer.
Thank you jack for a nice explanation!!
Amazing code. Where did this come from?? I have never seen fibonacci series printed in this manner. Its awesome.
Please visit this : Best c compiler for windows
Post a Comment