Question

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

x ← x + x
for k is in {1, 2, 3} do

x ← x + 1

x ← x + 5
Count the number of + operations done by this algorithm.

Answer 1

when writing pseudo codes make sure you make the indenting correctly because from looking at your pseudo code I cannot tell which statement belongs to which loop. If you cant indent at least put a bracket