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

#include <stdio.h>

int fibonacci (int n)
{
  if (n == 0) return 0;
  else if (n == 1) return 1;
  else return fibonacci(n - 2) + fibonacci(n - 1);
}

int main ()
{
  int n = 0;

  while (n <= 50) {
    printf("F(%d) = %d\n", n, fibonacci(n));
    n = n + 1;
  }
  
  return 0;
}