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 takes 80 seconds. A value of N greater than 47 results in integer overflow and incorrect results with all the compilers mentioned above. With most implementations, long int is a type the same size as int. Because there are a few implementations that provide a long int that is longer than an int, I used long as the argument and return types for the fib function. To get Fibonacci numbers up to N = 50 for checking the results of the program, I changed the long type in the recursive function to long long (a 19 digit integer type supported by GNU g++, but not ANSI/ISO C++). I compiled this using g++-3.0 under the Debian Linux 3.0 operating system on a K6-2/350 with a 100 MHz backplane and 400K RAM. On this somewhat slow machine, this version of the program took about two hours for N==50, giving presumably correct results. (I acknowledge that I did not look them up.) The results agree with the code with a long return and long parameter type up to N = 47. This function computes and discards too many of the Fibonacci numbers. This kind of recursion is called umbrella recursion because it spreads like an umbrella, recomputing values many times. //File: ch14prg1Fibonacci.cc //Chapter 14, Programming Problem #1 //Write a recursive function for a function having one //parameter that generates the nth Fibonacci number. #include iostream #include cmath //This is the full recursive versi