in Algorithms
263 views
1 vote
1 vote

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

 

in Algorithms
263 views

2 Comments

1
1

replace $n$ with $a*n$ here  .. $T(n) \in \Theta(n)$

2
2

Subscribe to GO Classes for GATE CSE 2022

1 Answer

1 vote
1 vote
by

1 comment

@aaa 1  

Thanks For Sharing Resources .

0
0