Answer:
yeah u can my brother go for it
Answer:
6 2 and 0
Explanation:
This algorithm doesn't work if the list is not ordered ascending.
In this example it is not, and indeed the item "1" is never found.
first cycle: first=0, last=12 so midpoint=6
second cycle: first=0, last=5 so midpoint=2
last cycle: first=0, last=1 so midpoint=0
then last is assigned -1 so the while statement is no longer true.
Answer:
The number of subproblems are given as
while the value of T(n) to be less than S(n) is for 342.
Explanation:
The number of subproblems are given as

Asymptotic running time for Strassen’s algorithm is 
Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be

Now, for T(n) to be smaller than S(n)

So,

So,
a=342