C++大学教程课后习题答案13.docVIP

Chapter 14 RECURSION 1. Solutions to and Remarks on Selected Programming Assignments 1. Fibonacci Numbers These solutions have been tested under two Linux versions using two versions of g++, under Windows XP with VC++ 6.0 and Borland 5.0. The full recursive version is slow. It takes about 17 seconds for 1 computation of Fib1(35) on an older, very slow machine (i486 DX2/100, 16 MB RAM). On a more modern machine (1 GHz Athlon. 266 MHz front side bus, 512 MB DDR RAM, fast disk drives) it runs a bit faster: N = 35 takes 3 seconds, N = 40 takes about 30 seconds, N = 41 about 50 seconds, and N = 42