Fibonacci implementation in Java

Fibonacci implementation

In mathematics, the Fibonacci numbers are the numbers in sequence. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two.


public class Main {
  public static void main(String[] args) {
    int n0 = 1, n1 = 1, n2; 
    System.out.print(n0 + " " + n1 + " ");
/*from   w  w w .j a v  a 2s  .  c o m*/
    for (int i = 0; i < 18; i++) { 
      n2 = n1 + n0; 
      System.out.print(n2 + " ");
      n0 = n1; // First previous becomes 2nd previous
      n1 = n2; // And current number becomes previous
    }
    System.out.println(); // Terminate the line
  }
}

The code above generates the following result.





















Home »
  Java Tutorial »
    Development »




Java Algorithms
Java Clipboard
Java Compiler
Java Desktop
Java Virtual Machine
Java Math
OS
Random
Java Robot
Java RuntimeMXBean
Java Timer
Java UUID
Java Internationalization