Distance
|a+bi| is the length of the vector from origin to (a,b).
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:
The total cost is $16.96
The cost per photo is $1.06
Step-by-step explanation:
Hello!
<h3><u>
Part 1:</u></h3>
1 roll of film costs $4.79. 1 roll of film has 16 photos. To develop the 16 photos, you need to pay $12.17.
First, let's find the total cost for the film and the development for 1 roll of film:
- Total Cost = Cost of Film + Cost of developing
- Total Cost = $4.79 + $12.17
- Total Cost = $16.96
<u>The total cost of 16 photos is $16.96</u>
<u />
<h3><u>Part 2:</u></h3>
Now, we have to find the price per picture on the roll of film. We know that there are 16 shots on the film, so we can simply divide the total price by 16 to find the price per picture.
Divide:
- $16.96 ÷ 16
- ($16 ÷ 16) + ($0.96 ÷ 16)
- $1 + $0.06
- $1.06
<u>The price per photo is $1.06</u>
Answer:
Step-by-step explanation:
The answer is c