斐波那契数列-数组与递归方式-C描述

int  f(int n ) {//递归方式调用if (n==1 || n ==2){return 1;}else {return f(n - 1) + f(n - 2);}}void Fibonacci_Array(const int num ) {//数组方式调用if (num < 2) {printf("呵呵");return;}int *f = malloc(num * sizeof(int));f[0] = 1;f[1] = 1;for (int i = 2; i < num; i++){f[i] = f[i - 1] + f[i - 2];}printf("\n%d", f[num -1]);free(f);}