|
-
March 27th, 2010, 11:11 AM
#1
Recursive Equation
Hello! i'm from Italy, and i'm trying to solve this equation:
T(n) = T(n - 1) + T(n - 2) + n
my result is that the big theta notation of this equation is Θ(2^n) and the big O notation is O(2^n) * (n)
but i think that i made something wrong. Can someone explain me how to calculate the tree main landau symbols of this equation? (O, Ω and Θ)? i need some help because i have the test not too far away. Thank you!
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|