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

syketb profile image

Understanding Big O Notation: A Beginner's Guide to Time and Space Complexity

Syket Bhattachergee -

nozibul_islam_113b1d5334f profile image

DSA: Essential Queue Interview Questions and Challenges

Nozibul Islam -

muhamadhhassan profile image

PHP Generics in Laravel 11

Muhammad Hassan -

mdarifulhaque profile image

2583. Kth Largest Sum in a Binary Tree

MD ARIFUL HAQUE -