585 views
1 votes
1 votes

T(n)=T(n/5)+T(7n/10)+an

a: constant

what will be the time complexity of the above recurrence relation??

Please share the approach for this kind of recurrence relation

 

1 Answer

1 votes
1 votes

Related questions

0 votes
0 votes
3 answers
1
aditi19 asked Oct 6, 2018
1,128 views
what is the recurrence relation for merge sort?
0 votes
0 votes
1 answer
2
Sambhrant Maurya asked Aug 7, 2018
391 views
If k is a positive constant, then the following divide and conquer recurrence evaluates to?T(n) = k ; n=1T(n) = 3 T (n/2) + kn ;n>1a)T(n)= 3kn2-knb)T(n)=3kn log23 - 2knc...