Pretty sure it’s 4 idk tho this is a tough one. Hahahaha
You would add up the length of all sides to get the area.
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
Multiply all the dimensions together to get 1000. 10 for each side satisfies this.
-2w < -18 <em>change the signs</em>
2w > 18 <em>divide both sides by 2</em>
<h3>w > 9</h3>
