Finding recurrence relations of an algorithm

Posted by Roarke on Stack Overflow See other posts from Stack Overflow or by Roarke
Published on 2010-05-27T08:53:48Z Indexed on 2010/05/27 9:01 UTC
Read the original article Hit count: 270

Filed under:

recurrence

|

relation

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        if n >= 2

for b > 0

my response was "how the heck did we know that?!?!"

So i'm wondering if there is a systematic approach, or just a logical way of getting these recurrence relations from the algorithms

can some one explain where the b and the two 2's come from?

© 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 relation

Django Querying Relation of Relation

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm stuck on a Django ORM issue that is bugging me. I have a set of models linked by a foreign key but the requirements are a bit odd. I need to list items by their relation's relation. This is hard to explain so I've tried to depict this below, given: Work ManyToMany(Award) Award ForeignKey(AwardCategory) AwardCategory I… >>> More
Are there known problems with >= and <= and the eval function in JS?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am currently writing a JS rules engine which at one point needs to evaluate boolean expressions using the eval() function. Firstly I construct an equation as such: var equation = "relation.relatedTrigger.previousValue" + " " + relation.operator + " " + "relation.value"; relation.relatedTrigger… >>> More
Découvrir la nouvelle génération CRM ? Connectez-vous au Customer Concepts TV le 24 april 2012

as seen on Oracle Blogs - Search for 'Oracle Blogs'
Accélérer votre stratégie commerciale Les entreprises doivent repenser leurs processus de vente, optimiser leur performance, augmenter la productivité des équipes et se concentrer sur les opportunités à plus fort potentiel. Danny Rippon, Oracle CRM Solutions Sales Development Director… >>> More
At what size of data does it become beneficial to move from SQL to NoSQL?

as seen on Programmers - Search for 'Programmers'
As a relational database programmer (most of the time), I read articles about how relational databases don't scale, and NoSQL solutions such as MongoDB do. As most of the databases I have developed so far have been small to mid scale, I have never had a problem that hasn't been solved by some indexing… >>> More
Django Admin: OneToOne Relation as an Inline?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am putting together the admin for a satchmo application. Satchmo uses OneToOne relations to extend the base Product model, and I'd like to edit it all on one page. It is possible to have a OneToOne relation as an Inline? If not, what is the best way to add a few fields to a given page of my admin… >>> More