用 C 语言实现 斐波那契数列

#include<stdio.h>int  fib_recur(int n ){    if (n<=2)        return 1;   else   return fib_recur(n-1)+fib_recur(n-2);}int fib_itera(int n){int res,pre_res,next_old_res;    res=pre_res=1;while(n>2){   n-=1;next_old_res=pre_res;pre_res=res;res=next_old_res+pre_res;}    return res;}int main(){   int n,x,m,i;    printf("请输入整数: ");    scanf("%d",&n);    printf("\n");m=n;    for( i=1;i<=n;i++){   printf("递归实现:\n"); printf("第%d个数的斐波那契数%d\n",i,fib_recur(i));}printf("\n\n");for( i=1;i<=m;i++){printf("迭代实现:\n"); printf("第%d个数的斐波那契数%d\n",i,fib_itera(i));}return 0;}