Answer:
what the heck why would you delete my answer the correct answer is c....
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²).
f(x) = -2x and g(x) = 4x - 8, find h(x) = f(x) + g(x).
Replace f(x) and g(x) with their given values:
h(x) = -2x + 4x -8
Combine like terms:
h(x) = 2x -8
Answer:
3. 8 ft²
4. 89.79 m²
Step-by-step explanation:
3. A=bh1/2
A=8x2x1/2
A=16x1/2
A=8 ft²
4. A=bh1/2
A= 24.6x7.3x1/2
A=179.58x1/2
A=89.79 m²
