/* fib1.c -- Fibonacci-Zahlen, naiv rekursiv */

#include <stdio.h>

int fibonacci (int n)
{
  printf("%*s[ F(%d) ]\n", 16-2*n, "", n);
  if (n == 0) return 0;
  else if (n == 1) return 1;
  else return fibonacci(n - 2) + fibonacci(n - 1);
}

int main ()
{
  printf("F(%d) = %d\n", 8, fibonacci(8));
  return 0;
}