Answer: 5?
Step-by-step explanation:
there are 5 prizes to be chosen from.
Given:
3:15 pm - start of first showing.
30 minutes break;
20 minutes late - 2nd showing.
4:50 - start of second showing.
4:50 - 0:20 = 4:30 should be the start of the second showing.
4:00 - 4:30 = 1/2 hour break
3:15 - 4:00 = duration of the 1st showing. 45 minutes in all.
4:50 + 0:45 = 5:35 pm end of the 2nd showing.
Yes, the 2nd showing will be over by 6:30 pm.
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:
y represents the amount in the bank account after 7 months.
Step-by-step explanation:
Let karma gets x money on his birthday.
He has 60 in his account initially
He deposits teh same money for the seven months
So, the money he has after the seven months is 7 x + 60
According to the question,
y =7 x + 60
It shows that the amount after seven months is y.
