devxlogo

How to Compute the Fibonacci Number Recursively

How to Compute the Fibonacci Number Recursively

Why Trust Us

The following code shows you how to compute the n Fibonacci number recursively:

int fibonacci(int k) {    if (k          return k;    }    return fibonacci(k - 2) + fibonacci(k - 1);}
devxblackblue

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist

Charlie Frank

Charlie has over a decade of experience in website administration and technology management. As the site admin, he oversees all technical aspects of running a high-traffic online platform, ensuring optimal performance, security, and user experience.
View Author
Show More