Question

Consider the following algorithm. x â 1 for i is in {1, 2, 3, 4} do for j is in {1, 2, 3} do x â x + x for k is in {1, 2, 3, 4, 5} do x â x + 1 x â x + 5 Count the number of + operations done by this algorithm.

Answer 1

i can't see some of the numbers

Step-by-step explanation:

Answer 2

Number of + operation done by this algorithm is 60

Step-by-step explanation:

i = 4

j = 3

k = 6

Now, let "n" be number of '+' operations

n = i × j + i × 2k

substituting the figures

n = 4 × 3 + 4 × (2 × 6)

n = 12 + 4 × 12

n = 12 + 48

n = 60