2011年8月24日
fibonacci算法
摘要： int hi,lo;hi=lo=1;hi=hi+lo; //2 3 5 8 13 ……lo=hi-lo;unsigned int Fib1(unsigned int n){ if (n == 1 || n == 2) return 1; else return Fib(n - 1) + Fib(n - 2);}unsigned int Fib2(unsigned int n){ unsigned int nRet, nP, nPp; nRet = nP = nPp = 1; if... 阅读全文
posted @ 2011-08-24 23:59 soderman 阅读(241) 评论(0) 推荐(0)