11 meteres per second could’ve the fastest he could travel
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²).
0.00373134328
I think you can round that but I think that's the answer.
It is given that a 4 in. x 5 in. picture is used to make a wall banner that is 48 in. x 60 in. Thus, we can see a small picture has been enlarged or expanded. Therefore, this is an expansion. Thus the complete answer will be:
A 4 in. x 5 in. picture is used to make a wall banner that is 48 in. x 60 in. This is an example of an Expansion.
Therefore, out of the given options, Option A is the correct option.
Step-by-step explanation:
Since we have given that
Amount of pay rate =$21
If she marked up by 78.7% , so it becomes
So, our amount for pay rate becomes
Now, he said he made a profit of 10%,so it becomes
So, our new pay rate becomes
This is the step through which we can get $41.28.
