[FEATURE REQUEST] Golden Ration formula to find Nth Fibonacci number

[jstar2708]

What would you like to Propose?

Golden ration formula

Problem statement : Find the nth Fibonacci number in O(1) time complexity.

Algorithm :

We can simply use the formula given below to find Nth Fibonacci number.

1/√5 * (0.5 * (( √5 + 1) ^ n) - (0.5 * ( 1 - √5) ^ n))

Issue details

So, the algorithm just uses formula for finding Nth Fibonacci number in O(1).

Additional Information

No response

[TanuSharma0802]

Hello Sir
Please assign this issue to me. I have good knowledge of java programming language and data structures and algorithms.

[debnath003]

#4513
Can somebody help me approve this PR? It has been a long time and I am waiting for a review! @debasishbsws @BamaCharanChhandogi

[Monachaudhary]

I bring with me a commitment to optimizing solutions with the finest space and time complexities. Rest assured, your task is in capable hands. Kindly assign this issue to me.

[debnath003]

@debasishbsws @BamaCharanChhandogi can you please check my PR? #4513

[debnath003]

@debasishbsws @BamaCharanChhandogi @yanglbme @vil02 Someone please check my PR #4513 and approve the PR for Hacktoberfest. It has been a long time but I didn't get the approval from any maintainer, please look into this matter! Thanks

[nikitha-m]

Hey, Im desperate to solve pls help and give it to me. Thanks

[vil02]

Closed by #4513.