of 1.00
while n > 0
n := 2n
Flag question
return n;
procedure divide(n: positive integer)
while n ≥ 0:
m := 1/n
n=n-1
return m;
procedure sum(n: positive integer)
sum := 0
i := 0
while i < n:
sum = sum + i
return sum;
procedure choose(a, b: integers)x := either a or b
return x;
How many procedures are algorithms?
A. 4
B. 1
C. 3
D. 2
The correct answer is:
1
