Question

Consider the following algorithm.
x ← 1
for i {1, 2, 3, 4}do
for j {1, 2, 3}do
x ← x + x
for k {1, 2, 3, 4, 5}do
x ← x + 1
x ← x + 5

Count the number of + operations done by this algorithm.
1

Answer 1

is it 4[ 3(1)+5(2) ] ?

Answer 2

it is hard to tell where the FOR loops end, because the indenting isn't consistent

Answer 3

Yes! Thank you very much!!!!