Fibonacci - Recursion compare

#include <time.h>
#include <stdio.h>
#include <time.h>

long long fib_r(int n){
    return n<=2?1:fib_r(n-2)+fib_r(n-1);
}

long long fib(int n){
    long long series[32000];
    int i=0;
    series[1] = 1;
    series[2] = 1;
    for(i=3; i<=n; i++){
        series[i] = series[i-1] + series[i-2];
    }
    return series[n];
}
void main() {

    time_t before;
    time_t after;
    int n = 45;

    /* first test */
    time(&before);
    long long res1 = fib_r(n);
    time(&after);
    printf("%lld\n",res1);
    printf("Total recursion time : %d\n",after - before);

    /* second test */
    n = 30000;
    time(&before);
    long long res2 = fib(n);
    time(&after);
    printf("%lld\n",res2);
    printf("Total normal time: %d\n", after - before);
}