6

Functions
and an
Introduction
Form ever follows function.
to Recursion
Louis Henri Sullivan
E pluribus unum.
(One composed of many.)
Virgil OBJECTIVES
O! call back yesterday, bid In this chapter you will learn:
time return.
William Shakespeare To construct programs modularly from functions.

Call me Ishmael. To use common math functions available in the C++

Standard Library.
Herman Melville
To create functions with multiple parameters.
When you call me that,
smile! The mechanisms for passing information between
Owen Wister functions and returning results.
Answer me in one word. How the function call/return mechanism is supported by
William Shakespeare the function call stack and activation records.
There is a point at which To use random number generation to implement game-
methods devour themselves. playing applications.
Frantz Fanon How the visibility of identiers is limited to specic
Life can only be understood regions of programs.
backwards; but it must be To write and use recursive functions, i.e., functions that
lived forwards. call themselves.
Soren Kierkegaard

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 2 Chapter 6 Functions and an Introduction to Recursion

Exercises
6.12 A parking garage charges a $2.00 minimum fee to park for up to three hours. The garage
charges an additional $0.50 per hour for each hour or part thereof in excess of three hours. The max-
imum charge for any given 24-hour period is $10.00. Assume that no car parks for longer than 24
hours at a time. Write a program that calculates and prints the parking charges for each of three
customers who parked their cars in this garage yesterday. You should enter the hours parked for each
customer. Your program should print the results in a neat tabular format and should calculate and
print the total of yesterdays receipts. The program should use the function calculateCharges to
determine the charge for each customer. Your outputs should appear in the following format:

Car Hours Charge

1 1.5 2.00
2 4.0 2.50
3 24.0 10.00
TOTAL 29.5 14.50

ANS:

1 // Exercise 6.12 Solution: Ex06_12.cpp

2 // Calculate charges for 3 cars at parking garage.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7 using std::fixed;
8
9 #include <iomanip>
10 using std::setprecision;
11 using std::setw;
12
13 #include <cmath>
14 using std::ceil;
15
16 double calculateCharges( double ); // function prototype
17
18 int main()
19 {
20 double hour; // number of hours for current car
21 double currentCharge; // parking charge for current car
22 double totalCharges = 0.0; // total charges
23 double totalHours = 0.0; // total number of hours
24 int first = 1; // used for printing table headers
25
26 cout << fixed; // set floating-point number format
27 cout << "Enter the hours parked for 3 cars: ";
28
29 // loop 3 times for 3 cars
30 for ( int i = 1; i <= 3; i++ )
31 {
32 cin >> hour;
33 totalHours += hour; // add current hours to total hours

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 3

34
35 // if first time through loop, display headers
36 if ( first )
37 {
38 cout << setw( 5 ) << "Car" << setw( 15 ) << "Hours"
39 << setw( 15 ) << "Charge\n";
40
41 first = 0; // set first to 0 to prevent from printing again
42 } // end if
43
44 // calculate current car's parking charge
45 currentCharge = calculateCharges( hour );
46 totalCharges += currentCharge; // update total charges
47
48 // display row data for current car
49 cout << setw( 3 ) << i << setw( 17 ) << setprecision( 1 ) << hour
50 << setw( 14 ) << setprecision( 2 ) << currentCharge << "\n";
51 } // end for
52
53 // display row data for totals
54 cout << setw( 7 ) << "TOTAL" << setw( 13 ) << setprecision( 1 )
55 << totalHours << setw( 14 ) << setprecision( 2 )
56 << totalCharges << endl;
57 return 0; // indicate successful termination
58 } // end main
59
60 // calculateCharges returns charge according to number of hours
61 double calculateCharges( double hours )
62 {
63 double charge; // calculated charge
64
65 if ( hours < 3.0 ) // $2 for up to 3 hours
66 charge = 2.0;
67 else if ( hours < 24.0 ) // $.50 for each extra hour
68 charge = 2.0 + .5 * ceil( hours - 3.0 );
69 else // maximum charge $10
70 charge = 10.0;
71
72 return charge; // return calculated charge
73 } // end function calculateCharges

Enter the hours parked for 3 cars: 1.5 4.0 24.0

Car Hours Charge
1 1.5 2.00
2 4.0 2.50
3 24.0 10.00
TOTAL 29.5 14.50

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 4 Chapter 6 Functions and an Introduction to Recursion

6.13 An application of function floor is rounding a value to the nearest integer. The statement
y = floor( x + .5 );

rounds the number x to the nearest integer and assigns the result to y. Write a program that reads
several numbers and uses the preceding statement to round each of these numbers to the nearest
integer. For each number processed, print both the original number and the rounded number.
ANS:

1 // Exercise 6.13 Solution: Ex06_13.cpp

2 // Rounding numbers using floor.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7 using std::fixed;
8
9 #include <iomanip>
10 using std::setprecision;
11
12 #include <cmath>
13 using std::floor;
14
15 void roundToIntegers( void ); // function prototype
16
17 int main()
18 {
19 roundToIntegers(); // call function roundToIntegers
20 return 0; // indicate successful termination
21 } // end main
22
23 // roundToIntegers rounds 5 inputs
24 void roundToIntegers( void )
25 {
26 double x; // current input
27 double y; // current input rounded
28
29 cout << fixed; // set floating-point number format
30
31 // loop for 5 inputs
32 for ( int loop = 1; loop <= 5; loop++ )
33 {
34 cout << "Enter a number: ";
35 cin >> x;
36
37 y = floor( x + .5 ); // y holds rounded input
38 cout << setprecision( 6 ) << x << " rounded is "
39 << setprecision( 1 ) << y << endl;
40 } // end for
41 } // end function roundToIntegers

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 5

Enter a number: 8.22

8.220000 rounded is 8.0
Enter a number: 7.98
7.980000 rounded is 8.0
Enter a number: 4.52
4.520000 rounded is 5.0
Enter a number: 6.9999
6.999900 rounded is 7.0
Enter a number: 3.345
3.345000 rounded is 3.0

6.16 Write statements that assign random integers to the variable n in the following ranges:
a) 1 n 2
ANS: n = 1 + rand() % 2;
b) 1 n 100
ANS: n = 1 + rand() % 100;
c) 0 n 9
ANS: n = rand() % 10;
d) 1000 n 1112
ANS: n = 1000 + rand() % 13;
e) 1 n 1
ANS: n = rand() % 3 - 1;
f) 3 n 11
ANS: n = rand() % 15 - 3;
6.18 Write a function integerPower( base, exponent ) that returns the value of

base exponent

For example, integerPower( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is a positive, non-

zero integer and that base is an integer. The function integerPower should use for or while to con-
trol the calculation. Do not use any math library functions.
ANS:

1 // Exercise 6.18 Solution: Ex06_18.cpp

2 // Calculate exponentiation of integers.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 int integerPower( int, int ); // function prototype
9
10 int main()
11 {
12 int exp; // integer exponent
13 int base; // integer base
14
15 cout << "Enter base and exponent: ";
16 cin >> base >> exp;
17 cout << base << " to the power " << exp << " is: "
18 << integerPower( base, exp ) << endl;

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 6 Chapter 6 Functions and an Introduction to Recursion

19 return 0; // indicate successful termination

20 } // end main
21
22 // integerPower calculates and returns b raised to the e power
23 int integerPower( int b, int e )
24 {
25 int product = 1; // resulting product
26
27 // multiply product times b e number of times
28 for ( int i = 1; i <= e; i++ )
29 product *= b;
30
31 return product; // return resulting product
32 } // end function integerPower

Enter base and exponent: 5 2

5 to the power 2 is: 25

6.20 Write a function multiple that determines for a pair of integers whether the second is a
multiple of the first. The function should take two integer arguments and return true if the second
is a multiple of the first, false otherwise. Use this function in a program that inputs a series of pairs
of integers.
ANS:

1 // Exercise 6.20 Solution: Ex06_20.cpp

2 // Determines whether, for a pair of integers,
3 // the second is a multiple of the first.
4 #include <iostream>
5 using std::cin;
6 using std::cout;
7 using std::endl;
8
9 bool multiple( int, int ); // function prototype
10
11 int main()
12 {
13 int x; // first integer
14 int y; // second integer
15
16 // loop 3 times
17 for ( int i = 1; i <= 3; i++ )
18 {
19 cout << "Enter two integers: ";
20 cin >> x >> y;
21
22 // determine if second is multiple of first
23 if ( multiple( x, y ) )
24 cout << y << " is a multiple of " << x << "\n\n";
25 else
26 cout << y << " is not a multiple of " << x << "\n\n";
27 } // end for

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 7

28
29 cout << endl;
30 return 0; // indicate successful termination
31 } // end main
32
33 // multiple determines if b is multiple of a
34 bool multiple( int a, int b )
35 {
36 return !( b % a );
37 } // end function multiple

Enter two integers: 3 4

4 is not a multiple of 3

Enter two integers: 12 3

3 is not a multiple of 12

Enter two integers: 3 12

12 is a multiple of 3

6.22 Write a function that displays at the left margin of the screen a solid square of asterisks
whose side is specified in integer parameter side. For example, if side is 4, the function displays the
following:

****
****
****
****

ANS:

1 // Exercise 6.22 Solution: Ex06_22.cpp

2 // Displays a solid square of asterisks.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 void square( int ); // function prototype
9
10 int main()
11 {
12 int side; // input side length
13
14 cout << "Enter side: ";
15 cin >> side;
16 cout << '\n';
17
18 square( side ); // display solid square of asterisks
19 cout << endl;

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 8 Chapter 6 Functions and an Introduction to Recursion

20 return 0; // indicate successful termination

21 } // end main
22
23 // square displays solid square of asterisks with specified side
24 void square( int side )
25 {
26 // loop side times for number of rows
27 for ( int row = 1; row <= side; row++ )
28 {
29 // loop side times for number of columns
30 for ( int col = 1; col <= side; col++ )
31 cout << '*';
32
33 cout << '\n';
34 } // end for
35 } // end function square

Enter side: 4

****
****
****
****

6.27 (Celsius and Fahrenheit Temperatures) Implement the following integer functions:
a) Function celsius returns the Celsius equivalent of a Fahrenheit temperature.
b) Function fahrenheit returns the Fahrenheit equivalent of a Celsius temperature.
c) Use these functions to write a program that prints charts showing the Fahrenheit equiv-
alents of all Celsius temperatures from 0 to 100 degrees, and the Celsius equivalents of
all Fahrenheit temperatures from 32 to 212 degrees. Print the outputs in a neat tabular
format that minimizes the number of lines of output while remaining readable.
ANS:

1 // Exercise 6.27 Solution: Ex06_27.cpp

2 // Fahrenheit and Celsius equivalents.
3 #include <iostream>
4 using std::cout;
5 using std::endl;
6
7 #include <iomanip>
8 using std::setw;
9
10 int celsius( int ); // function prototype
11 int fahrenheit( int ); // function prototype
12
13 int main()
14 {
15 // display table of Fahrenheit equivalents of Celsius temperatures
16 cout << "Fahrenheit equivalents of Celsius temperatures:" << endl;
17

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 9

18 // create 4 sets of table headers

19 for ( int t = 0; t < 4; t++ )
20 cout << setw( 7 ) << "Celsius" << setw( 12 ) << "Fahrenheit ";
21
22 cout << endl;
23
24 // display temperatures in blocks of 25
25 for ( int i = 0; i < 25; i++ )
26 {
27 for ( int j = 0; j <= 75; j += 25 )
28 cout << setw( 7 ) << i + j
29 << setw( 11 ) << fahrenheit( i + j ) << ' ';
30
31 cout << endl;
32 } // end for
33
34 // display equivalent for 100
35 cout << setw( 64 ) << 100 << setw( 11 ) << fahrenheit( 100 ) << endl;
36
37 // display table of Celsius equivalents of Fahrenheit temperatures
38 cout << "\nCelsius equivalents of Fahrenheit temperatures:" << endl;
39
40 // create 4 sets of table headers
41 for ( int t = 0; t < 4; t++ )
42 cout << setw( 10 ) << "Fahrenheit" << setw( 9 ) << "Celsius ";
43
44 cout << endl;
45
46 // display temperatures in blocks of 45
47 for ( int i = 32; i < 77; i++ )
48 {
49 for ( int j = 0; j <= 135; j += 45 )
50 cout << setw( 10 ) << i + j
51 << setw( 8 ) << celsius( i + j ) << ' ';
52
53 cout << endl;
54 } // end for
55
56 // display equivalent for 212
57 cout << setw( 67 ) << 212 << setw( 8 ) << celsius( 212 ) << endl;
58 return 0; // indicate successful termination
59 } // end main
60
61 // celsius returns Celsius equivalent of fTemp,
62 // given in Fahrenheit
63 int celsius( int fTemp )
64 {
65 return static_cast< int > ( 5.0 / 9.0 * ( fTemp - 32 ) );
66 } // end function celsius
67
68 // fahrenheit returns Fahrenheit equivalent of cTemp,
69 // given in Celsius
70 int fahrenheit( int cTemp )
71 {

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 10 Chapter 6 Functions and an Introduction to Recursion

72 return static_cast< int > ( 9.0 / 5.0 * cTemp + 32 );

73 } // end function fahrenheit

Fahrenheit equivalents of Celsius temperatures:

Celsius Fahrenheit Celsius Fahrenheit Celsius Fahrenheit Celsius Fahrenheit
0 32 25 77 50 122 75 167
1 33 26 78 51 123 76 168
2 35 27 80 52 125 77 170
3 37 28 82 53 127 78 172
4 39 29 84 54 129 79 174
5 41 30 86 55 131 80 176
6 42 31 87 56 132 81 177
7 44 32 89 57 134 82 179
8 46 33 91 58 136 83 181
9 48 34 93 59 138 84 183
10 50 35 95 60 140 85 185
...
Celsius equivalents of Fahrenheit temperatures:
Fahrenheit Celsius Fahrenheit Celsius Fahrenheit Celsius Fahrenheit Celsius
32 0 77 25 122 50 167 75
33 0 78 25 123 50 168 75
34 1 79 26 124 51 169 76
35 1 80 26 125 51 170 76
36 2 81 27 126 52 171 77
37 2 82 27 127 52 172 77
38 3 83 28 128 53 173 78
39 3 84 28 129 53 174 78
40 4 85 29 130 54 175 79
...

6.29 (Perfect Numbers) An integer is said to be a perfect number if the sum of its factors, including
1 (but not the number itself), is equal to the number. For example, 6 is a perfect number, because
6 = 1 + 2 + 3. Write a function perfect that determines whether parameter number is a perfect num-
ber. Use this function in a program that determines and prints all the perfect numbers between 1
and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect.
Challenge the power of your computer by testing numbers much larger than 1000.
ANS:

1 // Exercise 6.29 Solution: Ex06_29.cpp

2 // Determine perfect numbers between 1 and 1000.
3 // A number is perfect if it is equal to the sum of its factors.
4 #include <iostream>
5 using std::cout;
6 using std::endl;
7
8 bool isPerfect( int ); // function prototype
9 void printSum( int ); // function prototype
10
11 int main()
12 {
13 cout << "Perfect integers between 1 and 1000:" << endl;
14
15 // loop from 2 to 1000

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 11

16 for ( int j = 2; j <= 1000; j++ )

17 {
18 // if current integer is perfect
19 if ( isPerfect( j ) )
20 printSum( j ); // print it as sum of factors
21 } // end for
22
23 cout << endl;
24 return 0; // indicate successful termination
25 } // end main
26
27 // isPerfect returns true if value is perfect integer,
28 // i.e., if value is equal to sum of its factors
29 bool isPerfect( int value )
30 {
31 int factorSum = 1; // current sum of factors
32
33 // loop through possible factor values
34 for ( int i = 2; i <= value / 2; i++ )
35 {
36 // if i is factor
37 if ( value % i == 0 )
38 factorSum += i; // add to sum
39 } // end for
40
41 // return true if value is equal to sum of factors
42 return factorSum == value ? true : false;
43 } // end function isPerfect
44
45 // printSum displays value followed by factors in summation form
46 void printSum( int value )
47 {
48 cout << value << " = 1";
49
50 // loop through possible factor values
51 for ( int i = 2; i <= value / 2; i++ )
52 {
53 // if i is factor
54 if ( value % i == 0 )
55 cout << " + " << i; // display as part of sum
56 } // end for
57
58 cout << endl;
59 } // end function printSum

Perfect integers between 1 and 1000:

6 = 1 + 2 + 3
28 = 1 + 2 + 4 + 7 + 14
496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 12 Chapter 6 Functions and an Introduction to Recursion

6.33 Write a function qualityPoints that inputs a students average and returns 4 if a students
average is 90100, 3 if the average is 8089, 2 if the average is 7079, 1 if the average is 6069 and
0 if the average is lower than 60.
ANS:

1 // Exercise 6.33 Solution: Ex06_33.cpp

2 // Determine quality points on 0 to 4 scale
3 // for averages in 0 to 100 range.
4 #include <iostream>
5 using std::cin;
6 using std::cout;
7 using std::endl;
8
9 int qualityPoints( int ); // function prototype
10
11 int main()
12 {
13 int average; // current average
14
15 // loop for 5 inputs
16 for ( int loop = 1; loop <= 5; loop++ )
17 {
18 cout << "\nEnter the student's average: ";
19 cin >> average;
20
21 // determine and display corresponding quality points
22 cout << average << " on a 4 point scale is "
23 << qualityPoints( average ) << endl;
24 } // end for
25
26 cout << endl;
27 return 0; // indicate successful termination
28 } // end main
29
30 // qualityPoints takes average in range 0 to 100 and
31 // returns corresponding quality points on 0 to 4 scale
32 int qualityPoints( int average )
33 {
34 if ( average >= 90 ) // 90 <= average <= 100
35 return 4;
36 else if ( average >= 80 ) // 80 <= average <= 89
37 return 3;
38 else if ( average >= 70 ) // 70 <= average <= 79
39 return 2;
40 else if ( average >= 60 ) // 60 <= average <= 69
41 return 1;
42 else // 0 <= average < 60
43 return 0;
44 } // end function qualityPoints

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 13

Enter the student's average: 99

99 on a 4 point scale is 4

Enter the student's average: 72

72 on a 4 point scale is 2

Enter the student's average: 88

88 on a 4 point scale is 3

Enter the student's average: 65

65 on a 4 point scale is 1

Enter the student's average: 33

33 on a 4 point scale is 0

6.35 (Computers in Education) Computers are playing an increasing role in education. Write a
program that helps an elementary school student learn multiplication. Use rand to produce two pos-
itive one-digit integers. It should then type a question such as
How much is 6 times 7?

The student then types the answer. Your program checks the students answer. If it is correct, print
"Very good!", then ask another multiplication question. If the answer is wrong, print "No. Please try
again.", then let the student try the same question repeatedly until the student finally gets it right.
ANS:

1 // Exercise 6.35 Solution: Ex06_35.cpp

2 // Help user practice multiplication.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 #include <cstdlib>
9 using std::rand;
10 using std::srand;
11
12 #include <ctime>
13 using std::time;
14
15 void multiplication(); // function prototype
16
17 int main()
18 {
19 srand( time( 0 ) ); // seed random number generator
20 multiplication(); // begin multiplication practice
21 return 0; // indicate successful termination
22 } // end main
23
24 // multiplication produces pairs of random numbers and
25 // prompts user for product
26 void multiplication()
27 {

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 14 Chapter 6 Functions and an Introduction to Recursion

28 int x; // first factor

29 int y; // second factor
30 int response = 0; // user response for product
31
32 // use sentinel-controlled repetition
33 cout << "Enter -1 to End." << endl;
34
35 // loop until sentinel value read from user
36 while ( response != -1 )
37 {
38 x = rand() % 10; // generate 1-digit random number
39 y = rand() % 10; // generate 1-digit random number
40
41 cout << "How much is " << x << " times " << y << " (-1 to End)? ";
42 cin >> response;
43
44 // loop until sentinel value or correct response
45 while ( response != -1 && response != x * y )
46 {
47 cout << "No. Please try again." << endl << "? ";
48 cin >> response;
49 } // end while
50
51 // correct response
52 if ( response == x * y )
53 cout << "Very good!" << endl << endl;
54 } // end while
55
56 cout << "That's all for now. Bye." << endl;
57 } // end function multiplication

Enter -1 to End.
How much is 4 times 9 (-1 to End)? 36
Very good!

How much is 7 times 0 (-1 to End)? 0

Very good!

How much is 7 times 8 (-1 to End)? 55

No. Please try again.
? 56
Very good!

How much is 5 times 0 (-1 to End)? -1

That's all for now. Bye.

6.38 (Guess the Number Game) Write a program that plays the game of guess the number as
follows: Your program chooses the number to be guessed by selecting an integer at random in the
range 1 to 1000. The program then displays the following:

I have a number between 1 and 1000.

Can you guess my number?
Please type your first guess.

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 15

The player then types a first guess. The program responds with one of the following:

1. Excellent! You guessed the number!

Would you like to play again (y or n)?
2. Too low. Try again.
3. Too high. Try again.

If the players guess is incorrect, your program should loop until the player finally gets the number
right. Your program should keep telling the player Too high or Too low to help the player zero in
on the correct answer.
ANS:

1 // Exercise 6.38 Solution: Ex06_38.cpp

2 // Randomly generate numbers between 1 and 1000 for user to guess.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 #include <cstdlib>
9 using std::rand;
10 using std::srand;
11
12 #include <ctime>
13 using std::time;
14
15 void guessGame(); // function prototype
16 bool isCorrect( int, int ); // function prototype
17
18 int main()
19 {
20 srand( time( 0 ) ); // seed random number generator
21 guessGame();
22 return 0; // indicate successful termination
23 } // end main
24
25 // guessGame generates numbers between 1 and 1000 and checks user's guess
26 void guessGame()
27 {
28 int answer; // randomly generated number
29 int guess; // user's guess
30 char response; // 'y' or 'n' response to continue game
31
32 // loop until user types 'n' to quit game
33 do
34 {
35 // generate random number between 1 and 1000
36 // 1 is shift, 1000 is scaling factor
37 answer = 1 + rand() % 1000;
38
39 // prompt for guess
40 cout << "I have a number between 1 and 1000.\n"
41 << "Can you guess my number?\n"

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 16 Chapter 6 Functions and an Introduction to Recursion

42 << "Please type your first guess." << endl << "? ";
43 cin >> guess;
44
45 // loop until correct number
46 while ( !isCorrect( guess, answer ) )
47 cin >> guess;
48
49 // prompt for another game
50 cout << "\nExcellent! You guessed the number!\n"
51 << "Would you like to play again (y or n)? ";
52 cin >> response;
53
54 cout << endl;
55 } while ( response == 'y' );
56 } // end function guessGame
57
58 // isCorrect returns true if g equals a
59 // if g does not equal a, displays hint
60 bool isCorrect( int g, int a )
61 {
62 // guess is correct
63 if ( g == a )
64 return true;
65
66 // guess is incorrect; display hint
67 if ( g < a )
68 cout << "Too low. Try again.\n? ";
69 else
70 cout << "Too high. Try again.\n? ";
71
72 return false;
73 } // end function isCorrect

I have a number between 1 and 1000.

Can you guess my number?
Please type your first guess.
? 500
Too high. Try again.
? 250
Too low. Try again.
? 375
Too low. Try again.
? 438
Too high. Try again.
? 405
Too high. Try again.
? 380
Too low. Try again.
? 393
Too low. Try again.
? 399
Too high. Try again.
continued at top of next page

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 17

? 396
Too low. Try again.
? 398
Too high. Try again.
? 397

Excellent! You guessed the number!

Would you like to play again (y or n)? n

6.40 Write a recursive function power( base, exponent ) that, when invoked, returns
base exponent

For example, power( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal
to 1. Hint: The recursion step would use the relationship
base exponent = base base exponent - 1

and the terminating condition occurs when exponent is equal to 1, because

base1 = base

ANS:

1 // Exercise 6.40 Solution: Ex06_40.cpp

2 // Recursive exponentiation.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 long power( long, long ); // function prototype
9
10 int main()
11 {
12 long b; // base
13 long e; // exponent
14
15 cout << "Enter a base and an exponent: ";
16 cin >> b >> e;
17
18 // calculate and display b^e
19 cout << b << " raised to the " << e << " is " << power( b, e ) << endl;
20 return 0; // indicate successful termination
21 } // end main
22
23 // power recursively calculates base^exponent, assume exponent >= 1
24 long power( long base, long exponent )
25 {
26 if ( exponent == 1 ) // base case: exponent equals 1, return base
27 return base;
28 else // recursion step

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 18 Chapter 6 Functions and an Introduction to Recursion

29 return base * power( base, exponent - 1 );

30 } // end function power

Enter a base and an exponent: 3 4

3 raised to the 4 is 81

6.44 (Visualizing Recursion) It is interesting to watch recursion in action. Modify the factorial
function of Fig. 6.29 to print its local variable and recursive call parameter. For each recursive call,
display the outputs on a separate line and add a level of indentation. Do your utmost to make the
outputs clear, interesting and meaningful. Your goal here is to design and implement an output for-
mat that helps a person understand recursion better. You may want to add such display capabilities
to the many other recursion examples and exercises throughout the text.
ANS: .

1 // Exercise 6.44 Solution: Ex06_44.cpp

2 // Visualizing recursion with factorial function.
3 #include <iostream>
4 using std::cout;
5 using std::endl;
6
7 #include <iomanip>
8 using std::setw;
9
10 unsigned long factorial( unsigned long ); // function prototype
11
12 int main()
13 {
14 // Loop 10 times. During each iteration, calculate
15 // factorial( i ) and display result.
16 for ( int i = 0; i <= 10; i++ )
17 cout << setw( 2 ) << i << "! = " << factorial( i ) << endl;
18
19 return 0; // indicates successful termination
20 } // end main
21
22 // recursive definition of function factorial
23 unsigned long factorial( unsigned long number )
24 {
25 if ( number <= 1 ) // base case
26 {
27 cout << " Reached base case of 1" << endl;
28 return 1;
29 } // end if
30 else // recursion step
31 {
32 // add outputs and indentation to help visualize recursion
33 cout << setw( number * 3 ) << ""
34 << "local variable number: " << number << endl;
35 cout << setw( number * 3 ) << ""
36 << "recursively calling factorial( "
37 << number - 1 << " )" << endl << endl;

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 19

38 return ( number * factorial( number - 1 ) );

39 } // end else
40 } // end function factorial

Calculating factorial ( 0 )
Reached base case of 1
0! = 1

Calculating factorial ( 1 )
Reached base case of 1
1! = 1

Calculating factorial ( 2 )
local variable number: 2
recursively calling factorial( 1 )

Reached base case of 1

2! = 2

...

Calculating factorial ( 10 )
local variable number: 10
recursively calling factorial( 9 )

local variable number: 9

recursively calling factorial( 8 )

local variable number: 8

recursively calling factorial( 7 )

local variable number: 7

recursively calling factorial( 6 )

local variable number: 6

recursively calling factorial( 5 )

local variable number: 5

recursively calling factorial( 4 )

local variable number: 4

recursively calling factorial( 3 )

local variable number: 3

recursively calling factorial( 2 )

local variable number: 2

recursively calling factorial( 1 )

Reached base case of 1

10! = 3628800

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 20 Chapter 6 Functions and an Introduction to Recursion

6.48 Write function distance that calculates the distance between two points (x1, y1) and (x2,
y2). All numbers and return values should be of type double.
ANS:

1 // Exercise 6.48 Solution: Ex06_48.cpp

2 // Calculate distance between 2 points.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7 using std::fixed;
8
9 #include <iomanip>
10 using std::setprecision;
11
12 #include <cmath>
13 using std::pow;
14 using std::sqrt;
15
16 double distance( double, double, double, double ); // function prototype
17
18 int main()
19 {
20 double x1; // x coordinate of first point
21 double y1; // y coordinate of first point
22 double x2; // x coordinate of second point
23 double y2; // y coordinate of second point
24
25 // prompt for first point coordinates
26 cout << "Enter the first point: ";
27 cin >> x1 >> y1;
28
29 // prompt for second point coordinates
30 cout << "Enter the second point: ";
31 cin >> x2 >> y2;
32
33 // calculate and display distance
34 cout << fixed << "Distance between (" << setprecision( 1 ) << x1
35 << ", " << y1 << ") and (" << x2 << ", " << y2 << ") is "
36 << distance( x1, y1, x2, y2 ) << endl;
37 return 0; // indicate successful termination
38 } // end main
39
40 // distance calculates distance between 2 points
41 // given by (a1, b1) and (a2, b2)
42 double distance( double a1, double b1, double a2, double b2 )
43 {
44 return sqrt( pow( a1 - a2, 2 ) + pow( b1 - b2, 2 ) );
45 } // end function distance

Enter the first point: 8 9

Enter the second point: 0 1
Distance between (8.0, 9.0) and (0.0, 1.0) is 11.3

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 21

6.53 Find the error in each of the following program segments and explain how to correct it:
a) float cube( float ); // function prototype

double cube( float number ) // function definition

{
return number * number * number;
}
ANS: Error: The function definition defaults to a return type of int.
Correction: Specify a return type of float for the definition.
b) register auto int x = 7;
ANS: Error: Only one storage class specifier can be used.
Correction: Remove either register or auto.
c) int randomNumber = srand();
ANS: Error: Function srand takes an unsigned argument and does not return a value.
Correction: Use rand instead of srand.
d) float y = 123.45678;
int x;

x = y;
cout << static_cast< float >( x ) << endl;
ANS: Error: The assignment of y to x truncates decimal places.
Correction: Declare x as type float instead of int.
e) double square( double number )
{
double number;
return number * number;
}
ANS: Error: Variable number is declared twice.
Correction: Remove the declaration of variable number within the {}.
f) int sum( int n )
{
if ( n == 0 )
return 0;
else
return n + sum( n );
}
ANS: Error: Infinite recursion.
Correction: Change operator + to operator -.
6.56 Write a complete C++ program with the two alternate functions specified below, of which
each simply triples the variable count defined in main. Then compare and contrast the two ap-
proaches. These two functions are
a) function tripleByValue that passes a copy of count by value, triples the copy and re-
turns the new value and
b) function tripleByReference that passes count by reference via a reference parameter
and triples the original value of count through its alias (i.e., the reference parameter).
ANS:

1 // Exercise 6.56 Solution: Ex06_56.cpp

2 // Comparing call by value and call by reference.

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 22 Chapter 6 Functions and an Introduction to Recursion

3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 int tripleByValue( int ); // function prototype
9 void tripleByReference( int & ); // function prototype
10
11 int main()
12 {
13 int count; // local variable for testing
14
15 // prompt for count value
16 cout << "Enter a value for count: ";
17 cin >> count;
18
19 // using call by value
20 cout << "\nValue of count before call to tripleByValue() is: "
21 << count << "\nValue returned from tripleByValue() is: "
22 << tripleByValue( count )
23 << "\nValue of count (in main) after tripleCallByValue() is: "
24 << count;
25
26 // using call by reference
27 cout << "\n\nValue of count before call to tripleByReference() is: "
28 << count << endl;
29
30 tripleByReference( count );
31
32 cout << "Value of count (in main) after call to "
33 << "tripleByReference() is: " << count << endl;
34 return 0; // indicate successful termination
35 } // end main
36
37 // tripleByValue uses call by value parameter passing to triple value
38 int tripleByValue( int value )
39 {
40 return value *= 3;
41 } // end function tripleByValue
42
43 // tripleByReference uses call by referece parameter passing
44 // to triple variable referenced by valueRef
45 void tripleByReference( int &valueRef )
46 {
47 valueRef *= 3;
48 } // end function tripleByReference

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 Exercises 23

Enter a value for count: 8

Value of count before call to tripleByValue() is: 8

Value returned from tripleByValue() is: 24
Value of count (in main) after tripleCallByValue() is: 8

Value of count before call to tripleByReference() is: 8

Value of count (in main) after call to tripleByReference() is: 24

6.58 Write a program that uses a function template called min to determine the smaller of two
arguments. Test the program using integer, character and floating-point number arguments.
ANS:

1 // Exercise 6.58 Solution: Ex06_58.cpp

2 // Finding the min using a function template.
3 #include <iostream>
4 using std::cin;
5 using std::cout;
6 using std::endl;
7
8 // definition of function template min that finds the smaller of 2 values
9 template < class T >
10 T min( T value1, T value2 )
11 {
12 if ( value1 < value2 )
13 return value1;
14 else
15 return value2;
16 } // end function template min
17
18 int main()
19 {
20 // demonstrate min with int values
21 int int1; // first int value
22 int int2; // second int value
23
24 cout << "Input two integer values: ";
25 cin >> int1 >> int2;
26
27 // invoke int version of min
28 cout << "The smaller integer value is: " << min( int1, int2 );
29
30 // demonstrate min with char values
31 char char1; // first char value
32 char char2; // second char value
33
34 cout << "\n\nInput two characters: ";
35 cin >> char1 >> char2;
36
37 // invoke char version of min
38 cout << "The smaller character value is: " << min( char1, char2 );
39

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.
 24 Chapter 6 Functions and an Introduction to Recursion

40 // demonstrate min with double values

41 double double1; // first double value
42 double double2; // second double value
43
44 cout << "\n\nInput two double values: ";
45 cin >> double1 >> double2;
46
47 // invoke double version of min
48 cout << "The smaller double value is: " << min( double1, double2 )
49 << endl;
50 return 0; // indicate successful termination
51 } // end main

Input two integer values: 7 54

The smaller integer value is: 7

Input two characters: x e

The smaller character value is: e

Input two double values: 8.46 4.35

The smaller double value is: 4.35

2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved.