Answer:
9p−18
Step-by-step explanation:
Expand by distributing terms
(−9×2 ) (−9×−p)
Simplify
−18−9×−p
Regroup terms
−18−(−9p)
Remove parentheses
9p−18
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:
i am pretty sure that they are both congruent because if you look at it they both create a line that is diagonal and in the middle they meet at the letter H so yeahh I hope this was right can i please be brainliest? I am very good at math sooooo I am pretty sure this is correct and if its not please tell me what I did wrong and I will not complain one bit I will try to do better next time thanks :)))
The answer to your question is h=-4/41x+5/41
Answer:
If you reduce this to the lowest terms you get 4/9
Step-by-step explanation:
In order to simplify the fraction 32/72, you can divide each term by 8.
32/8 = 4
72/8 = 9
Therefore, we get 4/9
