recurrence maths

Posted by Tony on Stack Overflow See other posts from Stack Overflow or by Tony
Published on 2010-05-02T13:21:38Z Indexed on 2010/05/02 13:27 UTC
Read the original article Hit count: 472

Filed under:

recurrence

|

algorithm

|

maths

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?

© Stack Overflow or respective owner

Related posts about recurrence

C#: Recurrence Calandar issue of Lotus notes

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi all, I am creating a Recurrence pattern in calendar items. But there is a issue as before clicking "Save and Send Invitations" button of Lotus notes 8.5, i am able to view the "RepeatForUnit" field from document property and based on its value i am identifying the Recurrence type like (D: for… >>> More
Finding recurrence relations of an algorithm

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm reading my algorithms text book, and I'm reading about recurrence relations and finding the algorithms big O complexity. I run across this line "In the case of the merge-sort algorithm, we get the recurrence equation: t(n) = b if n < 2 = 2t(n/2) +bn … >>> More
Recurrence relation solution

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm revising past midterms for a final exam this week and am trying to make sense of a solution my professor posted for one of past exams. (You can see the original pdf here, question #6). I'm given the original recurrence relation T(m)=3T(n/2) + n and am told T(1) = 1. I'm pretty sure the solution… >>> More
recurrence maths

as seen on Stack Overflow - Search for 'Stack Overflow'
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… >>> More
recurrence solution, too loose a bound?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have the following worked out: T(n) = T(n - 1) + n = O(n^2) Now when I work this out I find that the bound is very loose. Have I done something wrong or is it just that way? >>> More

Related posts about algorithm

Jpeg Algorithm vs BMP Algorithm?

as seen on Super User - Search for 'Super User'
I'm just wonder, what the differences are between creating a BMP file algorithm and JPG file algorithm ? If you know the others images' format algorithm, please post them. Thanks. >>> More
word disambiguation algorithm (Lesk algorithm)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hii.. Can anybody help me to find an algorithm in Java code to find synonyms of a search word based on the context and I want to implement the algorithm with WordNet database. For example, "I am running a Java program". From the context, I want to find the synonyms for the word "running", but the… >>> More
Search algorithm (with a sort algorithm already implemented)

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, Im doing a Java application and Im facing some doubts in which concerns performance. I have a PriorityQueue which guarantees me the element removed is the one with greater priority. That PriorityQueue has instances of class Event (which implements Comparable interface). Each Event is associated… >>> More
Is there any algorithm for finding LINES by PIXEL COLORS on picture?

as seen on Stack Overflow - Search for 'Stack Overflow'
So I have Image like this I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea) I need algorithm for finding all straight lines on it by just reading colors of pixels. No hard math, no Haar, no Hough. Some algorithm which would be based on points… >>> More
collsion issues with quadtree [on hold]

as seen on Game Development - Search for 'Game Development'
So i implemented a Quad tree in Java for my 2D game and everything works fine except for when i run my collision detection algorithm, which checks if a object has hit another object and which side it hit.My problem is 80% of the time the collision algorithm works but sometimes the objects just go… >>> More