Professional Documents
Culture Documents
CO1003 - Chapter 5 - Iterative Statements
CO1003 - Chapter 5 - Iterative Statements
3
Content
p Introduction
p while.. Statements
p do..while.. Statements
p for.. Statements
p Nested Repetition Statements
p continue Statements
p break Statements
p Summary
4
Introduction
p Control statements in C
n Sequence
p Assignment
p Function calling
p …
n Selection
p if
p if..else..
p switch..case..
n Repetition
p for..
p while..
p do..while..
5
Introduction
p Given a void main() {
double positiveNumber[10] = {2, 1, 3, 10, 8, 3, 4, 5, 9, 12};
set of n
int n = 10;
positive double minNumber = positiveNumber[0];
int iteration = 1;
numbers,
while (iteration < n) {
find the if (minNumber <= positiveNumber[iteration])
iteration = iteration + 1;
smallest
else {
one. minNumber = positiveNumber[iteration];
iteration = iteration + 1;
(Chapter 1 –
}
p 1. <Condition> is evaluated.
p 2. If <Condition> is true ( 0), <Statements> are performed
and then go to step 3. Otherwise, i.e. if <Condition> is false
(=0), go to step 4.
p 3. Go back to step 1.
p 4. End the repetition statement and move forward. 8
while.. Statements
false (= 0)
i<=3
true ( 0)
printf(…);
i++;
false (= 0)
i>=3
true ( 0)
printf(…);
i++;
9
while.. Statements
Write a program to receive a natural number from a user. If an invalid
value is entered, ask the user to input again until a valid one is obtained.
10
while.. Statements
Given N, the number of the first natural numbers
greater than 0, calculate and print the total sum of
these N first natural numbers.
11
while.. Statements
Given N, a natural number greater than 0, calculate and print the
factorial of N: N! = 1*2*..*N = (N-1)!*N
12
Given a natural number N
while.. Statements
greater than 0, list a series of
Fibonacci numbers smaller than N.
13
do..while.. Statements
do {
<Statement1>;
<Statements>
…
<Statementk>; true( 0)
} <Condition>
printf(…);
i++;
true( 0)
i<=3
false(=0)
printf(…);
i++;
true( 0)
i>=3
false(=0)
do..while.. Statements
Write a program to receive a natural number from a user. If an invalid
value is entered, ask the user to input again until a valid one is obtained.
16
do..while.. Statements
Given N, the number of the first natural numbers
greater than 0, calculate and print the total sum of
these N first natural numbers.
17
do..while.. Statements
Given N, a natural number greater than 0, calculate and print the
factorial of N: N! = 1*2*..*N = (N-1)!*N
18
Given a sequence of N numbers input sequentially
by a user, find the minimum one.
19
for.. Statements
<expression_1>
false (=0)
<expression_2>
true ( 0)
<Statements> <expression_3>
false (=0)
<expression_2>
true ( 0)
<Statements> <expression_3>
1. <expression_1> is evaluated.
2. <expression_2> is evaluated.
3. If <expression_2> is true ( 0), <Statements> are performed,
<expression_3> is evaluated, and then go to step 2. Otherwise, i.e.
if <expression_2> is false (=0), go to step 4.
4. End the repetition statement and move forward. 21
for.. Statements
for (<expression_1>; <expression_2>; <expression_3>) <Statement>;
is regarded as:
<expression_1>;
while (<expression_2>) {
<Statement>;
<expression_3>;
}
false (=0)
i<=3
true ( 0)
printf(…); i++;
24
for.. Statements
Given N, a natural number greater than 0, calculate and print the
factorial of N: N! = 1*2*..*N = (N-1)!*N
25
for.. Statements
Given a natural number N greater than 0, list all the squared numbers
smaller than the given number.
26
for.. Statements
27
while (<expression_1>) { Nested Repetition
…
do {
…
Statements
}
while (<expression_2>);
…
for(<expression_3>;<expression_4>;<expression_5>) {
…
}
…
}
29
Nested Repetition Statements
Given a natural number N greater than 0, print a
triangle full of stars. N is the height of the star triangle.
N=4
30
Given a natural number greater than 0,
N=5
31
continue Statements
n for.. statements
32
continue Statements
33
break Statements
n while.. statements
n for.. statements
34
break Statements
35
Infinite Loops
while (1) <Statement>; do {
<Statement1>;
while (1) {
…
<Statement1>;
<Statementk>;
…
}
<Statementk>;
while (1);
}
for (<expression_1>; 1;<expression_3>)
for (; ;) <Statement>;
<Statement>;
for (; ;) {
<Statement1>; for (<expression_1>; 1;<expression_3>)
{ <Statement1>;
…
<Statementk>; …
} <Statementk>;
} 36
Infinite Loops
37
Put them all together
Write a program to compute an approximation of e with
a positive number N input by a user. Print the
approximated value and its difference from a commonly
used value which is 2.71828. It is given that: 0! = 1! = 1.
38
Put them all together
Write a program to compute an
approximation of the power x of e
where there is no use of a true value
of e. Accuracy of an approximation is
dependent on how large n is.
39
Put them all together
p Given problem: print the first NxN natural
numbers greater than 0 in a spiral-shaped
matrix with a given N.
Given N = 4, a printed spiral-shaped matrix is as follows:
1 2 3 4 0
12 13 14 5 12
11 16 15 6
10 9 8 7
1 2 3 4 5 0
16 17 18 19 6 16
15 24 25 20 7 24
14 23 22 21 8
13 12 11 10 9 40
N=10
N=9
43