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.
It is rotated 180 degrees, and it doesn't matter wether clockwise or counterclockwise. 180 degrees results in the same thing both ways
9514 1404 393
Answer:
C
Step-by-step explanation:
The step shown indicates that y was eliminated from the equations. For choices A, B, D, this is done by adding the equations together (the y-coefficients are opposites). The result of doing that gives x-terms of 4x, 0x, and 0x, respectively. These x-terms do not match the one given: 2x.
For choice C, the y-term is eliminated by subtracting twice the second equation from the first. Doing that gives ...
(4x +2y) -2(x +y) = (14) -2(3)
4x +2y -2x -2y = 14 -6 . . . . eliminate parentheses
2x = 8 . . . . . . . . . . . . . . collect terms
2017 - 4000 = -2017. Hope it helps!
