Lecture 4

Control Structures

while, for, and do/while loops

1
2.7 while Repetition
Structure
 Repetition structure
 Action repeated while some condition remains true

 Psuedocode

while there are more items on my shopping list

Purchase next item and cross it off my list
 while loop repeated until condition becomes false
 Example
int product = 2;
while ( product <= 1000 )
product = 2 * product;

2
2.7 The while Repetition
Structure
 Flowchart of while loop

true
product <= 1000 product = 2 * product

false

3
2.8 Formulating Algorithms
(Counter-Controlled
Repetition)
 Counter-controlled repetition

 Loop repeated until counter reaches certain value

 Definite repetition
 Number of repetitions known
 Example
A class of ten students took a quiz. The grades
(integers in the range 0 to 100) for this quiz are
available to you. Determine the class average on
the quiz.

4
2.8 Formulating Algorithms
(Counter-Controlled
Repetition)
 Pseudocode for example:

Set total to zero

Set grade counter to zero
While grade counter is less than ten
Input the next grade
Add the grade into the total
Add one to the grade counter
Set the class average to the total divided by ten
Print the class average

 Next: C++ code for this example

5
1 // Fig. 2.7: fig02_07.cpp
2 // Class average program with counter-controlled repetition. fig02_07.
3 #include <iostream>
4 cpp (1 of
5
6
using std::cout;
using std::cin;
2)
7 using std::endl;
8
const int MAX_GRADES = 10;
9 // function main begins program execution
10 int main()
11 {
12 int total; // sum of grades input by user
13 int gradeCounter; // number of grade to be entered next
14 int grade; // grade value
15 int average; // average of grades
16
17 // initialization phase
18 total = 0; // initialize total
19 gradeCounter = 0; // initialize loop counter
20

6
21 // processing phase
22 while ( gradeCounter < MAX_GRADES ) { // loop MAX_GRADES times fig02_07.cp
23 cout << "Enter grade: "; // prompt for input p
24 cin >> grade; // read grade from user
25 total = total + grade; // add grade to total
(2 of 2)
26 gradeCounter = gradeCounter + 1; // increment counter
27 }
28
29 // termination phase
30 average = total / MAX_GRADES; // integer division
31
32 // display result
33 cout << "Class average is " << average << endl;
34
35 return 0; // indicate program ended successfully
36
37 } // end function main

7
Enter grade: 98 fig02_07.cp
Enter grade: 76 p
Enter grade: 71 output (1
Enter grade: 87 of 1)
Enter grade: 83
Enter grade: 90
Enter grade: 57
Enter grade: 79
Enter grade: 82
Enter grade: 94
Class average is 81

8
2.9 Formulating Algorithms
(Sentinel-Controlled
Repetition)
Suppose problem becomes:


Develop a class-averaging program that will process an

arbitrary number of grades each time the program is run
 Unknown number of students
 How will program know when to end?
 Sentinel value
 Indicates “end of data entry”
 Loop ends when sentinel input
 Sentinel chosen so it cannot be confused with regular
input
 -1 in this case

9
2.9 Formulating Algorithms
(Sentinel-Controlled
Repetition)
 Top-down, stepwise refinement

 Begin with pseudocode representation of top

Determine the class average for the quiz
 Divide top into smaller tasks, list in order
Initialize variables
Input, sum and count the quiz grades
Calculate and print the class average

10
2.9 Formulating Algorithms
(Sentinel-Controlled
Repetition)
 Many programs have three phases

 Initialization
 Initializes the program variables
 Processing
 Input data, adjusts program variables
 Termination
 Calculate and print the final results
 Helps break up programs for top-down refinement

11
2.9 Formulating Algorithms
(Sentinel-Controlled
Repetition)
Refine the initialization phase


Initialize variables
goes to
Initialize total to zero
Initialize counter to zero
 Processing
Input, sum and count the quiz grades
goes to
Input the first grade (possibly the sentinel)
While the user has not as yet entered the sentinel
Add this grade into the running total
Add one to the grade counter
Input the next grade (possibly the sentinel)

12
2.9 Formulating Algorithms
(Sentinel-Controlled
Repetition)
 Termination

Calculate and print the class average

goes to
If the counter is not equal to zero
Set the average to the total divided by the counter
Print the average
Else
Print “No grades were entered”
 Next: partial C++ program

13
 Counter-controlled loop
21 // processing phase
22 while ( gradeCounter < MAX_GRADES ) { // loop MAX_GRADES
times
23 cout << "Enter grade: "; // prompt for input
24 cin >> grade; // read grade from user
25 total = total + grade; // add grade to total
26 gradeCounter = gradeCounter + 1; // increment counter
27 }

 Sentinel-controlled (event-controlled) loop

13 const int SENTINEL = -1;

27 // processing phase
28 // get first grade from user
29 cout << "Enter grade, “ << SENTINEL << “ to end: "; // prompt for input
30 cin >> grade; // read grade from user
31
32 // loop until sentinel value read from user
33 while ( grade != SENTINEL ) {
34 total = total + grade; // add grade to total
35 gradeCounter = gradeCounter + 1; // increment counter
36
37 cout << "Enter grade, “ << SENTINEL << ” to end: "; // prompt for input
38 cin >> grade; // read next grade
39
40 } // end while

14
3 #include <iostream>
8
9
using std::fixed; fig02_09.c
10 #include <iomanip> // parameterized stream manipulators pp
11 using std::setprecision; // sets numeric output precision

49 // display average with two digits of precision fig02_09.c

50
51
cout << "Class average is " << setprecision( 2 )
<< fixed << average << endl; pp
output (1
Enter grade, -1 to end: 75 of 1)
Enter grade, -1 to end: 94
Enter grade, -1 to end: 97
Enter grade, -1 to end: 88
Enter grade, -1 to end: 70
Enter grade, -1 to end: 64 setprecision(2)prints two digits past
Enter grade, -1 to end: 83 fixed forcesdecimal
output topoint
print(rounded to fit precision).
Enter grade, -1 to end: 89 in fixed point format (not
Enter grade, -1 to end: -1 scientific notation). Also,that use this must include <iomanip>
Programs
Class average is 82.50 forces trailing zeros and
decimal point to print.
15
Include <iostream>
2.10 Nested Control
Structures
Problem statement
A college has a list of test results (1 = pass, 2 = fail) for
10 students. Write a program that analyzes the results.
If more than 8 students pass, print "Raise Tuition".
 Notice that
 Program processes 10 results
 Fixed number, use counter-controlled loop
 Two counters can be used
 One counts number that passed
 Another counts number that fail
 Each test result is 1 or 2
 If not 1, assume 2

16
2.10 Nested Control
Structures
 Top level outline
Analyze exam results and decide if tuition should be raised
 First refinement
Initialize variables
Input the ten quiz grades and count passes and failures
Print a summary of the exam results and decide if tuition should be
raised
 Refine
Initialize variables
to
Initialize passes to zero
Initialize failures to zero
Initialize student counter to zero

17
2.10 Nested Control
Structures
 Refine
Input the ten quiz grades and count passes and failures
to
While student counter is less than ten
Input the next exam result
If the student passed
Add one to passes
Else
Add one to failures
Add one to student counter

18
2.10 Nested Control
Structures
 Refine
Print a summary of the exam results and decide if tuition
should be raised
to
Print the number of passes
Print the number of failures
If more than eight students passed
Print “Raise tuition”
 Program next

19
1 // Fig. 2.11: fig02_11.cpp
2
3
// Analysis of examination results.
#include <iostream>
fig02_11.c
4
5 using std::cout;
pp
6
7
using std::cin;
using std::endl;
(1 of 2)
8 const int MAX_STUDENTS = 10; const int MIN_PASSES = 8;
9 const int PASS = 1; const int FAIL = 2;
10 // function main begins program execution
11 int main()
12 {
13 // initialize variables in declarations
14 int passes = 0; // number of passes
15 int failures = 0; // number of failures
16 int studentCounter = 0; // student counter
17 int result; // one exam result
18
19 // process 10 students using counter-controlled loop
20 while ( studentCounter < MAX_STUDENTS ) {
21
22 // prompt user for input and obtain value from user
23 cout << "Enter result (“ << PASS << ” = pass, “ << FAIL << ” = fail): ";
24 cin >> result;
25 20
25 // if result 1, increment passes; if/else nested in while
26 if ( result == PASS ) // if/else nested in while fig02_11.c
27 passes = passes + 1;
28 pp
29
30
else // if result not 1, increment failures
failures = failures + 1;
(2 of 2)
31
32 // increment studentCounter so loop eventually terminates
33 studentCounter = studentCounter + 1;
34
35 } // end while
36
37 // termination phase; display number of passes and failures
38 cout << "Passed " << passes << endl;
39 cout << "Failed " << failures << endl;
40
41 // if more than eight students passed, print "raise tuition"
42 if ( passes > MIN_PASSES )
43 cout << "Raise tuition " << endl;
44
45 return 0; // successful termination
46
47 } // end function main

21
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 2 fig02_11.cp
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
p
Enter result (1 = pass, 2 = fail): 1 output (1 of
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 1 1)
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Passed 6
Failed 4

Enter result (1 = pass, 2 = fail): 1

Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 2
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Enter result (1 = pass, 2 = fail): 1
Passed 9
Failed 1
Raise tuition 22
2.11 Assignment Operators
 Assignment expression abbreviations
 Addition assignment operator
c = c + 3; abbreviated to
c += 3;
 Statements of the form
variable = variable operator expression;
can be rewritten as
variable operator= expression;
 Other assignment operators
d -= 4 (d = d - 4)
e *= 5 (e = e * 5)
f /= 3 (f = f / 3)
g %= 9 (g = g % 9)

23
2.12 Increment and
Decrement Operators
 Increment operator (++) - can be used instead of c += 1
 Decrement operator (--) - can be used instead of c -= 1
 Preincrement
 When the operator is used before the variable (++c or –
c)
 Variable is changed, then the expression it is in is
evaluated.
 Postincrement
 When the operator is used after the variable (c++ or
c--)
 Expression the variable is in executes, then the variable
is changed.
24
2.12 Increment and
Decrement Operators
 Increment operator (++)
 Increment variable by one
 c++
 Same as c += 1
 Decrement operator (--) similar
 Decrement variable by one
 c--

25
2.12 Increment and
Decrement Operators
 Preincrement
 Variable changed before used in expression
 Operator before variable (++c or --c)
 Postincrement
 Incremented changed after expression
 Operator after variable (c++, c--)

26
2.12 Increment and
Decrement Operators
 If c = 5, then
 cout << ++c;
 c is changed to 6, then printed out
 cout << c++;
 Prints out 5 (cout is executed before the increment.
 c then becomes 6

27
2.12 Increment and
Decrement Operators
 When variable not in expression
 Preincrementing and postincrementing have
same effect
++c;
cout << c;
and
c++;
cout << c;

are the same

28
1 // Fig. 2.14: fig02_14.cpp
2 // Preincrementing and postincrementing. fig02_14.
3 #include <iostream>
4 cpp
5
6
using std::cout;
using std::endl;
(1 of 2)
7
8 // function main begins program execution
9 int main()
10 {
11 int c; // declare variable
12
13 // demonstrate postincrement
14 c = 5; // assign 5 to c
15 cout << c << endl; // print 5
16 cout << c++ << endl; // print 5 then postincrement
17 cout << c << endl << endl; // print 6
18
19 // demonstrate preincrement
20 c = 5; // assign 5 to c
21 cout << c << endl; // print 5
22 cout << ++c << endl; // preincrement then print 6
23 cout << c << endl; // print 6

29
24
25 return 0; // indicate successful termination fig02_14.cp
26
27 } // end function main p
(2 of 2)
5
5
6 fig02_14.cp
5 p
6
6 output (1
of 1)

30
2.13 Essentials of Counter-
Controlled Repetition
 Counter-controlled repetition requires
 Name of control variable/loop counter
 Initial value of control variable
 Condition to test for final value
 Increment/decrement to modify control variable
when looping

31
 3
1 // Fig. 2.16: fig02_16.cpp Outline 2
2 // Counter-controlled repetition.
3 #include <iostream>
fig02_16.cpp
4 (1 of 1)
5 using std::cout;
6 using std::endl;
7
8 // function main begins program execution
9 int main()
10 {
11 int counter = 1; // initialization
12
13 while ( counter <= 10 ) { // repetition condition
14 cout << counter << endl; // display counter
15 ++counter; // increment
16
17 } // end while
18
19 return 0; // indicate successful termination
20
21 } // end function main
 2003 Prentice Hall, Inc.
All rights reserved.
 3
1 Outline 3
2
3
fig02_16.cpp
4 output (1 of 1)
5
6
7
8
9
10

 2003 Prentice Hall, Inc.

All rights reserved.
2.13 Essentials of Counter-
Controlled Repetition
 The declaration
int counter = 1;
 Names counter
 Declares counter to be an integer
 Reserves space for counter in memory
 Sets counter to an initial value of 1

34
2.14 for Repetition
Structure
 General format when using for loops
for ( initialization; LoopContinuationTest;
increment )
statement
 Example
for( int counter = 1; counter <= 10;
counter++ )
cout << counter << endl; No
semicolon
 Prints integers from one to ten after last
statement

35
2.14 for Repetition
Structure
 for loops can usually be rewritten as while
loops
initialization;
while ( loopContinuationTest){
statement
increment;
}
 Initialization and increment
 For multiple variables, use comma-separated lists
for (int i = 0, j = 0; j + i <= 10; j++, i+
+)
cout << j + i << endl;
36
 3
1 // Fig. 2.20: fig02_20.cpp Outline 7
2 // Summation with for.
3 #include <iostream>
fig02_20.cpp
4 (1 of 1)
5 using std::cout;
6 using std::endl; fig02_20.cpp
7 output (1 of 1)
8 // function main begins program execution
9 int main()
10 {
11 int sum = 0; // initialize sum
12
13 // sum even integers from 2 through 100
14 for ( int number = 2; number <= 100; number += 2 )
15 sum += number; // add number to sum
16
17 cout << "Sum is " << sum << endl; // output sum
18 return 0; // successful termination
19
20 } // end function main

 2003 Prentice Hall, Inc.

Sum is 2550 All rights reserved.
2.15 Examples Using the
for Structure
 Vary the control variable from 1 to 100 in increments of 1
 Vary the control variable from 100 to 1 in increments of -
1(decrements of 1)
 Vary the control variable from 7 to 77 in steps of 7
 Vary the control variable from 20 to 2 in steps of -2
 Vary the control variable over the following sequence: 2, 5, 8, 11, 14,
17, 20
 Vary the control variable over the following sequence: 99, 88, 77,
66, 55, 44, 33, 22, 11, 0

38
2.15 Examples Using the
for Structure
 Program to calculate compound interest
 A person invests $1000.00 in a savings account yielding 5
percent interest. Assuming that all interest is left on deposit in the
account, calculate and print the amount of money in the account
at the end of each year for 10 years. Use the following formula
for determining these amounts:
a = p(1+r)n
 p is the original amount invested (i.e., the principal),
r is the annual interest rate,
n is the number of years and
a is the amount on deposit at the end of the nth year

39
 4
1 // Fig. 2.21: fig02_21.cpp Outline 0
2 // Calculating compound interest.
3 #include <iostream>
fig02_21.cpp
4 (1 of 2)
5 using std::cout;
6 using std::endl;
7 using std::ios;
8 using std::fixed;
9
10 #include <iomanip>
11
12 using std::setw;
13 using std::setprecision;
14
15 #include <cmath> // enables program to use function
pow
16
17 // function main begins program execution
18 int main()
19 {
20 double amount; // amount on deposit
21 double principal = 1000.0; // starting principal  2003 Prentice Hall, Inc.
22 double rate = .05; // interest rate All rights reserved.
 4
24 // output table column heads Outline 1
25 cout << "Year" << setw( 21 ) << "Amount on deposit" << endl;
26 Sets the field width to at least
fig02_21.cpp
27 21 characters. If output less(2 of 2)
// set floating-point number format
28 cout << fixed << setprecision( 2 than
); 21, it is right-justified.
29
30 // calculate amount on deposit for each of ten years
31 for ( int year = 1; year <= 10; year++ ) {
32
33 // calculate new amount for specified year
34 amount = principal * pow( 1.0 + rate, year );
35
36 // output one table row
37 cout << setw( 4 ) << year
38 << setw( 21 ) << amount << endl;
39
40 } // end for
41
42 return 0; // indicate successful termination
43
44 } // end function main
 2003 Prentice Hall, Inc.
All rights reserved.
 4
Year Amount on deposit Outline 2
1 1050.00
2 1102.50
fig02_21.cpp
3 1157.63 output (1 of 1)
4 1215.51
5 1276.28
6 1340.10
7 1407.10
8 1477.46
9 1551.33
10 1628.89

Numbers are right-justified

due to setw statements (at
positions 4 and 21).

 2003 Prentice Hall, Inc.

All rights reserved.
2.17 do/while Repetition
Structure
 Similar to while structure
 Makes loop continuation test at end, not
beginning
 Loop body executes at least once
 Format action(s)

do {
statement true

} while ( condition ); condition

false

43
 4
1 // Fig. 2.24: fig02_24.cpp Outline 4
2 // Using the do/while repetition structure.
3 #include <iostream>
fig02_24.cpp
4 (1 of 1)
5 using std::cout;
6 using std::endl; fig02_24.cpp
7 output (1 of 1)
8 // function main begins program execution
9 int main()
10 {
11 int counter = 1; // initialize counter
12 Notice the preincrement in
13 do { loop-continuation test.
14 cout << counter << " "; // display counter
15 } while ( ++counter <= 10 ); // end do/while
16
17 cout << endl;
18
19 return 0; // indicate successful termination
20
21 } // end function main

 2003 Prentice Hall, Inc.

1 2 3 4 5 6 7 8 9 10 All rights reserved.
2.21 Structured-
Programming Summary
 Structured programming
 Programs easier to understand, test, debug and modify
 Rules for structured programming
 Only use single-entry/single-exit control structures
 Rules
1) Begin with the “simplest flowchart”
2) Any rectangle (action) can be replaced by two rectangles
(actions) in sequence
3) Any rectangle (action) can be replaced by any control
structure (sequence, if, if/else, switch, while, do/while or for)
4) Rules 2 and 3 can be applied in any order and multiple times

45
2.21 Structured-
Programming Summary
Representation of Rule 3 (replacing any rectangle with a control structure)

Rule 3

Rule 3 Rule 3

46
2.21 Structured-
Programming Summary
 All programs broken down into
 Sequence
 Selection
 if, if/else, or switch
 Any selection can be rewritten as an if statement
 Repetition
 while, do/while or for
 Any repetition structure can be rewritten as a while
statement

47