retagged by
1,394 views
2 votes
2 votes

Can you please solve this following question further?

What will be the time complexity?

retagged by

1 Answer

0 votes
0 votes
First of all second part is a decreasing function so there will be no effect of f (n)= 1/log (n)  so you can just neglect it and just find complexity for T (n)=T (n-2)   that is O(n).

Related questions

1 votes
1 votes
1 answer
1
Manu Thakur asked Aug 14, 2017
1,207 views
Suppose$A = log^{k}n$$B = n^{\epsilon} $ Assume that $ k\geq 1$ and $ \epsilon 0$What is the relation b/w the asymptotic time complexities of A and B?1. A = O(B)2. A =...
0 votes
0 votes
0 answers
2
garvit_vijai asked Nov 17, 2018
449 views
How to solve the following recurrence relation?T(n) = T(n-6) + n2 , n>7T(n) = 1 , n<= 7
1 votes
1 votes
1 answer
3
aditi19 asked Oct 27, 2018
835 views
how to compute time complexity of this kind of recurrence relation-T(n)=T(n/2)+T(n/4)+T(n/8)+n