Page 89 - TP_Play_V2.1_class6
P. 89
Example 2: Write an algorithm and draw a flowchart to find the smallest in two numbers
A and B.
Algorithm: Flowchart:
Step 1 Start. Start
Step 2 Read two numbers and store
them in A and B.
Read A and B
Step 3 Compare numbers A and B. If A
is less than B, then
print "A is smallest" if
Yes
Else A < B Print A is smallest
print "B is smallest"
No
Step 4 Stop.
Print B is smallest
Stop
Example 3: Write an algorithm and draw a flowchart to add first 100 natural numbers.
Algorithm: Flowchart:
Step 1 Start. Start
Step 2 Let Sum = 0 and N = 0
Step 3 N = N + 1 Sum = 0, N = 0
Step 4 Sum = Sum + N
Step 5 Check If N >= 100 then N = N + 1
print Sum
Sum = Sum + N
Else
Go to Step 3.
Is
Step 6 Stop. No
N >=
100?
Yes
Print Sum
Stop
Algorithmic Intelligence 87

