Browse DevX
Sign up for e-mail newsletters from DevX


Tip: How to Compute the Fibonacci Number Recursively

See how to compute the Fibonacci number recursively in Java.


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);


Visit the DevX Tip Bank


Octavia Andreea Anghel is a senior PHP developer currently working as a primary trainer for programming teams that participate at national and international software-development contests. She consults on developing educational projects at a national level. She is a coauthor of the book "XML Technologies--XML in Java" (Albastra, ISBN 978-973-650-210-1), for which she wrote the XML portions. In addition to PHP and XML, she's interested in software architecture, web services, UML, and high-performance unit tests.
Thanks for your registration, follow us on our social networks to keep up-to-date