package fibonacci;
/**
 * @author Fenyvesi Tibor
 */
public class Fibonacci {

    static int x;
    static int y;

    static int Fibonacci(int a) {
        if ((a == 0) || (a == 1))
            return a;
        else
            return Fibonacci(a-1) + Fibonacci(a-2);
    }

    public static void main(String[] args) {

        // Ciklussal:
        System.out.println("Fibonacci számok ciklussal (1 - 20):");
        int i = 1;
        x = 0;
        y = 1;
        while (i <= 10) {
            System.out.print(x + ", " + y + (i == 10 ? " ":", "));
            x = x + y;
            y = y + x;
            i++;
        }
        System.out.println(System.getProperty("line.separator"));


        // Rekurzióval
        System.out.println("Fibonacci számok rekurzióval (21 - 30):");
        i = 20;
        while (i <= 29) {
            System.out.print(Fibonacci(i) + (i == 29 ? " ":", "));
            i++;
        }
        System.out.println(System.getProperty("line.separator"));
    }
}