DEV Community

RajRishi Vishwakarma
RajRishi Vishwakarma

Posted on

Finding Nth Fibonacci number in constant time.

#codequality #algorithms #optimized

The below code uses Binet's Algorithm to find the nth Fibonacci number.

int nthFibonacci(int n){
    double phi= double(1+sqrt(5))/2; 
    return round(pow(phi,n)/sqrt(5));
}
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

Read next

aarushnautiyal profile image

What are Classes and How to Use Them in JavaScript ? 🤔🤔

Aarushnautiyal -

brainvault_tech profile image

UNDERSTANDING MEMORY USAGE: INSIGHTS ON RECURSION AND DO WHILE LOOPS

Brainvault Technologies -

ashsajal profile image

JavaScript Lexical Scope Explained shortly

Ashfiquzzaman Sajal -

mike_andreuzza profile image

How to create a bottom drawer with Tailwind CSS and Alpinejs

Michael Andreuzza -