| recursion/fib-iter-rec.c - En iterativ udgave af fib programmeret rekursivt. | Lektion 11 - slide 13 : 27 Program 2 |
#include <stdio.h>
// Prototype:
long fib_iter(int n, int i, long small, long large);
long fib(int n){
return fib_iter(n, 0, 0, 1);
}
long fib_iter(int n, int i, long small, long large){ // fib(i) == small
if (i == n)
return small;
else
return fib_iter(n, i + 1, large, large + small);
}
int main(void) {
long i;
for(i = 0; i < 100; i++)
printf("Fib(%li) = %li\n", i, fib(i));
return 0;
}