Answer:
i will do it
Step-by-step explanation:
Sqrt(80) = Sqrt(16) x sqrt(5)
= 4 x sqrt(5)
Y = 2x - 17, comparing to y = mx + c, slope m = 2.
If perpendicular, the new slope would be -1/2, that is the negative reciprocal of 2.
And passing through (-8 , 1).
using y = mx + c, and x = -8, y = 1, m = -1/2
1 = -1/2*-8 + c
1 = 4 + c
1 - 4 = c
c = -3
y = mx + c, substituting m = -1/2, and c = -3, y = -(1/2)x - 3.
Option C.
The major advantage of exponential notation is that it simplifies a number into a more readable form, so we don't have to count all the zeros every time we look at it / calculate it. It helps us to identify big numbers as small decimals which we are more familiar with.
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²).
