recurrence maths
- by Tony
Hi all!
I have the following:
T(n) <= c floor(n/2) + c ceiling(n/2) + 1
= cn + 1
T(n) = O(n)
I don't understand how it gets from the first equation to the second equation? What part of the maths am I missing to understand how this comes to be?
Is it done using 'Simplifying Equations' or some other rules?
Can someone help me?