斐波那契数列的递归及非递归

#include<stdio.h>#define N 10//递归int RecursiveFib(int n){    if (n <= 1)        return n;    return RecursiveFib(n - 1) + RecursiveFib(n - 2);}//非递归int CycleFib(int n){    int ret = 0;    int i = 0, n1 = 0, n2 = 1;    if (n <= 2)        return 1;    if (n > 2)    {        for (i = 2; i <= n; i++)        {            ret = n1 + n2;            n1 = n2;            n2 = ret;        }        return ret;    }}int main(){    printf("RecursiveFib is:%d\n", RecursiveFib(N));    printf("CycleFib is:%d\n", CycleFib(N));    system("pause");    return 0;}