05slide Short Version
05slide Short Version
System.out.println("Welcome to Java!");
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
2
Opening Problem
Problem:
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
100
times …
…
…
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
System.out.println("Welcome to Java!");
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
3
Introducing while Loops
int count = 0;
while (count < 100) {
System.out.println("Welcome to Java");
count++;
}
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
4
Objectives
▪ To write programs for executing statements repeatedly using a
while loop (§5.2).
▪ To follow the loop design strategy to develop loops
(§§5.2.1–5.2.3).
▪ To control a loop with a sentinel value (§5.2.4).
▪ To obtain large input from a file using input redirection rather
than typing from the keyboard (§5.2.5).
▪ To write loops using do-while statements (§5.3).
▪ To write loops using for statements (§5.4).
▪ To discover the similarities and differences of three types of
loop statements (§5.5).
▪ To write nested loops (§5.6).
▪ To learn loops from a variety of examples.
▪ To implement program control with break and continue (§5.9).
▪ To write a program that displays prime numbers (§5.11).
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
6
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
7
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
8
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
9
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
10
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
11
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
12
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
13
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
14
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
15
Problem: Repeat Addition Until Correct
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
17
Problem: An Advanced Math Learning
Tool
The Math subtraction learning tool
program generates just one question for
each run. You can use a loop to generate
questions repeatedly. This example gives a
program that generates five questions and
reports the number of the correct answers
after a student answers all five questions.
SubtractionQuizLoo Run
p
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
18
Ending a Loop with a Sentinel
Value
Often the number of times a loop is
executed is not predetermined. You may
use an input value to signify the end of the
loop. Such a value is known as a sentinel
value.
do {
// Loop body;
Statement(s);
} while (loop-continuation-condition);
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
21
for Loops
for (initial-action; loop- int i;
continuation-condition; for (i = 0; i < 100; i++) {
action-after-each- System.out.println(
iteration) {
"Welcome to Java!");
// loop body;
Statement(s); }
}
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
22
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
23
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
24
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
25
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
26
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
27
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
28
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
29
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
30
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
31
animation
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
32
Note
The initial-action in a for loop can be a list of
zero or more comma-separated expressions. The
action-after-each-iteration in a for loop can be a
list of zero or more comma-separated statements.
Therefore, the following for loop is correct..
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
33
Note
If the loop-continuation-condition in a for loop is
omitted, it is implicitly true. Thus the statement
given below in (a), which is an infinite loop, is
correct. Nevertheless, it is better to use the
equivalent loop in (b) to avoid confusion:
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
34
Caution
Adding a semicolon at the end of the for
clause before the loop body is a common
mistake, as shown below: Logic
Error
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
35
Caution, cont.
Similarly, the following loop is also wrong:
int i=0;
while (i < 10); Logic
{ Error
System.out.println("i is " + i);
i++;
}
In the case of the do loop, the following
semicolon is needed to end the loop.
int i=0;
do {
System.out.println("i is " + i);
i++;
} while (i<10); Correct
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
36
Which Loop to Use?
The three forms of loop statements, while, do-while, and
for, are expressively equivalent; that is, you can write a
loop in any of these three forms. For example, a while
loop in (a) in the following figure can always be
converted into the following for loop in (b):
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
37
Recommendations
Use the one that is most intuitive and
comfortable for you. In general, a for loop may
be used if the number of repetitions is known,
as, for example, when you need to print a
message 100 times. A while loop may be used if
the number of repetitions is not known, as in
the case of reading the numbers until the input
is 0. A do-while loop can be used to replace a
while loop if the loop body has to be executed
before testing the continuation condition.
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
38
Nested Loops
Problem: Write a program that uses
nested for loops to print a multiplication
table.
MultiplicationTa Run
ble
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
39
Problem:
Finding the Greatest Common
Divisor
Problem: Write a program that prompts the user to enter
two positive integers and finds their greatest common
divisor.
Solution: Suppose you enter two integers 4 and 2, their
greatest common divisor is 2. Suppose you enter two
integers 16 and 24, their greatest common divisor is 8. So,
how do you find the greatest common divisor? Let the two
input integers be n1 and n2. You know number 1 is a
common divisor, but it may not be the greatest commons
divisor. So you can check whether k (for k = 2, 3, 4, and so
on) is a common divisor for n1 and n2, until k is greater
than n1 or n2. GreatestCommonDivi Run
sor
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
40
Using break and continue
Examples for using the break and
continue keywords:
● TestBreak.java
TestBreak Run
● TestContinue.java
TestContin Run
ue
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
41
break
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
42
continue
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
43
Guessing Number Problem Revisited
GuessNumberUsingBrea Run
k
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
44
Problem: Displaying Prime
Numbers
Problem: Write a program that displays the first 50 prime
numbers in five lines, each of which contains 10 numbers.
An integer greater than 1 is prime if its only positive
divisor is 1 or itself. For example, 2, 3, 5, and 7 are prime
numbers, but 4, 6, 8, and 9 are not.
Solution: The problem can be broken into the following
tasks:
• For number = 2, 3, 4, 5, 6, ..., test whether the number
is prime.
• Determine whether a given number is prime.
• Count the prime numbers.
• Print each prime number, and PrimeNumber Run
print 10 numbers per
line.
Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd.
All rights reserved.
45