[C How To Program] 习题4.38
2014-12-14 20:35
387 查看
#include <stdio.h> long Fib( int ); long FibNoRecur( int ); int main(){ int i = 1; while(i++ <= 100){ printf("%d Fibo: %ld\n",i, FibNoRecur(i)); } } long Fib( int n ){ if( n == 0 || n == 1){ return n; } return Fib( n - 1 ) + Fib( n - 2 ); } /* overflow when n >=92 */ long FibNoRecur( int n ){ long a[n+1], i; a[0] = 0; a[1] = 1; for(i = 2; i <= n; i++){ a[i] = a[i - 1] + a[i - 2]; } return a ; }
相关文章推荐
- [C How To Program] 习题6.35 二分查找
- [C How To Program] 习题7.17 龟兔赛跑问题
- [C How To Program] 习题 3.36
- [C How To Program] 习题3.38
- [C How To Program] 习题3.46
- [C How To Program] 习题5.22
- [C How To Program] 习题5.28-最大公约数
- [C How To Program] 习题6.24c 骑士漫游问题
- [C How To Program] 习题5.32 学习算术
- [C How To Program] 习题6.30 erato_traverse
- 《java how to program》第三版1-6章大部分习题答案[原创]
- [C How To Program] 习题5.37 x的n次方
- [C How To Program] 习题6.32 递归的选择排序
- [C How To Program] 习题5.39 汉诺塔
- [C How To Program] 习题6.39 递归求数组的最小值
- [C How To Program] 习题6.38 字符串反转打印
- 《java how to program》习题全解----正在创作中
- Program Library HOWTO
- C HOW TO PROGRAM!中
- How to think like a Computer Scientist: 课后习题第十九、二十章