☑Kizspy.me
Answer (Choose 1 answer)
☐ A
Back
Next
Which of the following algorithms are recursive?
(i) procedure A(n: nonnegative even integer)
if n = 0 then A(n):= 1;
else A(n): A(n-2)*3
(ii) procedure A(n: nonnegative even integer)
if n = 0 then y = 1;
else
begin
end
y: 1; m n div 2;
for i=1 to m
A. Only (i)
y: = y*3;
B. Both of them
C. Only (ii)
D. None of them
FUO.sh
sh the exam.
