Kizspy | Question: 18
(Choose 1 answer)
(See picture)
A. 10
B. 8
C. 6
D. 12
E. 14
FJOVERFLOW.COM
Given the algorithm
procedure TT(n: integer)
sum:=0
i:=0
j:=0
while (i<√n)
sum: sum+1
i:=i+1
while (j<√n/2)
j:=j+1
sum:=sum+1
Print(sum)
If n=9, how many additions are required?
