456 views
0 votes
0 votes

I came across a term solving a Recurrence Relation using recursion method and it was - 

2log(n) = n.

How's this being solved? Thanks.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
1 votes
1 votes
1 answer
4
pC asked Jan 26, 2016
395 views
T(n) = $\sum_{0}^{n-1}$ T(i) + cn