in Algorithms retagged by
304 views
0 votes
0 votes
T(n) = 2 T(n) + n
in Algorithms retagged by
304 views

1 comment

is it a typo?
0
0

2 Answers

1 vote
1 vote
its not a recurrence relation!

2 Comments

it is a recurrence relation mam

just masters theorem cannot be applied.

 

but now how to solve it even i dont know
0
0

Tn=2Tn+n⟹Tn=−nTn=2Tn+n⟹Tn=−n

Why is this a recurrence relation?

In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms. (wiki)

1
1
1 vote
1 vote
T(n) = 2T(n) + n

 

changing side of T(n),

T(n) = - n

So, I think it should be order of O(1)

Since, negative doesn't make sense.

Related questions