/**
 * Created by alexei.yakushyn on 6/23/17.
 */
public class FibonacciRecursion {

//  f(n)=f(n-1) + f(n-2);

    public static int fiboRecu(int num) {

        if (num <= 0) {
            return 0;
        }

        if (num == 1) {
            return 1;
        }
        if (num == 2) {
            return 1;
        } else {
            return fiboRecu(num - 1) + fiboRecu(num - 2);
        }

    }

    public static void main(String[] args) {

        int f = 11;
        for (int i = 1; i <= f; i++) {
            System.out.print(fiboRecu(i) + " ");

        }

    }
}