/* fib2.c -- Fibonacci-Zahlen, iterativ (konstanter Platz) */

#include <stdio.h>

int fibonacci (int n)
{
  if (n == 0) return 0;
  else if (n == 1) return 1;
  else {
    int a = 0;
    int b = 1;
    int i = 2;
    while (i <= n) {
      /* Invariante: a == F(i-2) und b == F(i-1) */
      int sum = a + b;
      a = b;
      b = sum;
      i = i + 1;
      /* Wieder korrekt */
    }
    /* Hier ist i == n + 1, also b == F(n) */
    return b;
  }
}

int main ()
{
  int n = 0;

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