Computing Fibonacci Numbers, a 2nd Example
        // A Java application that prints the first 9 Fibonacci
        // numbers.  Each even Fibonacci number is marked by an *.
        // Fib[m] = Fib[m-2] + Fib[m-1], for m >= 3.

        class Fibonacci {
 
            static final int MAX_INDEX = 10;	// A named constant
public static void main( String[] args ) { int fib_m2 = 1; int fib_m1 = 1, fib_m; String evenMark; System.out.println( "1: " + fib_m2 ); // + is the string // concatenation operator for (int i = 2; i < MAX_INDEX; i++){ if ( fib_m1 % 2 == 0 ) evenMark = " *"; else evenMark = ""; System.out.println( i + ": " + fib_m1 + evenMark ); fib_m = fib_m2 + fib_m1; fib_m2 = fib_m1; fib_m1 = fib_m; // Update for next loop } } }
The program produces the following output:
Link to the source code.