959 views
1 1 vote

Please explain 2nd line complexity.

 

Please log in or register to answer this question.

Position:
Show:

Related questions

3 3 votes
1 1 answer
844
844 views
srijankarak_123 asked Aug 28, 2024
844 views
find out the time complexity of the given recurrence relation using back substitution method T(n) = T(n/2) + n logn
0 0 votes
0 0 answers
840
840 views
kira000 asked Jan 17, 2023
840 views
Let $f(n)$ be a positive increasing function. Consider the below two statements:S1: if an algorithm is $\Theta(f(n))$ in the average case, then it is $\Omega(f(n))$ in th...