Answer:
The solution is (0, 2).
Step-by-step explanation:
Here we have two different equations for y. Equate them to eliminate y. Solve the resulting equation for x:
y = −1/3x + 2 = y = x + 2
Simplifying, we get (-1/3)x = x, and so x must be 0.
Then, using the second equation, we find that y = 0 + 2 = 2.
The solution is (0, 2).
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²).
Answer:
y=1/2x-4
Step-by-step explanation:
y-y1=m(x-x1)
y+3=1/2(x-2)
y+3=1/2x-1
y=1/2x-4
You use the extra info and end up getting the wrong answer
