She would sell it for $26.60 after the markup.
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²).
9514 1404 393
Answer:
(24, -24)
Step-by-step explanation:
Dilation centered at the origin multiplies each coordinate by the dilation factor.
image = 4 × (6, -6)
image = (24, -24)
Answer:
187.68
Step-by-step explanation:
240*.32=76.8
240-76.8=163.2
163.2*.15=24.48
163.2+24.48=187.68