Answer:
27
Step-by-step explanation:
1 + (5)(2) + (1 + 3)^2
1 + 10 + (1 + 3)^2
11 + (1+3)^2
11+4^2
11+16
27
<h3><u>
Hope this helps! Have an amazing day!</u></h3>
We have a "rectangular" double loop, meaning that both loops go to completion.
So there are 3*4=12 executions of t:=t+ij.
Assuming two operatiions per execution of the innermost loop, (i.e. ignoring the implied additions in increment of subscripts), we have 12*2=24 operations in all.
Here the number of operations (+ or *) is exactly known (=24).
Big-O estimates are used for cases with a varying scale of operations, governed by a variable (usually n) to indicate the sensitivity of the number of operations relative to a change in the size of n.
Here we do not have a scale, nor n is defined. The number of operations is constant and known at 24. So a variable is required to find the big-O estimate.
<span>The base in the question you provided is the variable x,
hope this helps.
~BlurryFace</span>
7033/10000 is the answer you're looking for
