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²).
To answer that think of this as how many groups of 7/8 cups of salad are needed.
If Marion is with four friends, she need salad for five total people.
She will need five groups of 7/8 cups of salad.
This is represented as 5 x 7/8.
5 x 7/8 = 4 3/8 cups of salad
None of them are like terms you have 5a 5b and 4
