recurrence solution, too loose a bound?

Posted by Tony on Stack Overflow See other posts from Stack Overflow or by Tony
Published on 2010-05-02T09:23:39Z Indexed on 2010/05/02 9:27 UTC
Read the original article Hit count: 411

Filed under:

recurrence

|

big-o

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?

© 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 big-o

Big Data – Learning Basics of Big Data in 21 Days – Bookmark

as seen on SQL Authority - Search for 'SQL Authority'
Earlier this month I had a great time to write Bascis of Big Data series. This series received great response and lots of good comments I have received, I am going to follow up this basics series with further in-depth series in near future. Here is the consolidated blog post where you can find all… >>> More
Big Data – Beginning Big Data – Day 1 of 21

as seen on SQL Authority - Search for 'SQL Authority'
What is Big Data? I want to learn Big Data. I have no clue where and how to start learning about it. Does Big Data really means data is big? What are the tools and software I need to know to learn Big Data? I often receive questions which I mentioned above. They are good questions and honestly when… >>> More
Big Data – Various Learning Resources – How to Start with Big Data? – Day 20 of 21

as seen on SQL Authority - Search for 'SQL Authority'
In yesterday’s blog post we learned how to become a Data Scientist for Big Data. In this article we will go over various learning resources related to Big Data. In this series we have covered many of the most essential details about Big Data. At the beginning of this series, I have encouraged… >>> More
Big Data – Is Big Data Relevant to me? – Big Data Questionnaires – Guest Post by Vinod Kumar

as seen on SQL Authority - Search for 'SQL Authority'
This guest post is by Vinod Kumar. Vinod Kumar has worked with SQL Server extensively since joining the industry over a decade ago. Working on various versions of SQL Server 7.0, Oracle 7.3 and other database technologies – he now works with the Microsoft Technology Center (MTC) as a Technology Architect… >>> More
Big Blue Bets Big on Red Hat's Virtualization Technology

as seen on Internet.com - Search for 'Internet.com'
Virtually Speaking: In the next battleground for the cloud, IBM's choice of Red Hat's virtualization technology may be changing the landscape, but don't count VMware out just yet. >>> More