Find the nth fibonacci number (starts from 0). C implementation.
This is a(n):
Details:
@AdiChat
I would like to work on this issue.
@sonasingh46 Sure, go for it :+1:
Let me know in our discussion forum once you open a pull request
@AdiChat How can I open pull request on my solution?
Hi @mor11235 I am glad to see that you successfully opened a pull request
You shall fix the location of the code. Do let me know if you need help in it :smile:
Hi @AdiChat , I don't know how to do this. I will be glad if you can help.
Sure @mor11235 I will fix your pull request. You can message me directly at our forum here so that I can explain you the process as well. :smile:
@mor11235 I would like to implement this in java.
You might wish to consider generalising this to arbitrary integer sequences related to the Pisot-Vijayaraghavan numbers (See https://en.wikipedia.org/wiki/Pisot%E2%80%93Vijayaraghavan_number).
That would make the algorithm a lot more widely usable & general.
For a concretely useful application, see for example here:
http://extremelearning.com.au/unreasonable-effectiveness-of-quasirandom-sequences/#GeneralizingGoldenRatio
I would like to work on this issue
can i work on this in python or c++ /
Can i work on this issue using C#/Javascript ?
Most helpful comment
Hi @AdiChat , I don't know how to do this. I will be glad if you can help.