Talk:Amortized analysis

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science (Rated Start-class, High-importance)
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Start-Class article Start  This article has been rated as Start-Class on the project's quality scale.
 High  This article has been rated as High-importance on the project's importance scale.
 
WikiProject Mathematics (Rated Start-class, Mid-priority)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Mid Priority
 Field: Discrete mathematics

This page looks very much like the textbook sited below. So much indeed that it looks like copyright infringement. Perhaps that someone with knowledge about this subject could rewrite this page. Sadly I'm just learning about it so I don't have enough knowledge to say something about it. --Soyweiser 10:54, 17 November 2006 (UTC)

The statement "guarantees worst case performance" is confusing. It sounds like "guarantees that the algorithm will always perform in the worst way possible." This is especially a problem because the phrase is in the intro to the article. The phrase should be replaced with "guarantees at least worst case performance" or "defines the performance for the worst case" or " guarantees performance will be no worse than some lower bound" or something. — Preceding unsigned comment added by 216.243.5.110 (talk) 16:04, 3 August 2011 (UTC)

The term "worst case input" is used. If you can tell me what that means... For some size of input, this kind of input will produce the most number of steps? The problem is that for each size of input, the "kind" of input could be wildly different. — Preceding unsigned comment added by 68.147.63.98 (talk) 20:19, 18 March 2012 (UTC)

Copyright violation[edit]

Soyweiser is correct, there was/is copyright violation on this page. When whole ideas are taken from a published work, or very substantial text, slight reordering or adding other sources does not remove the copyright burden.

Example section was almost cut-and-pasted from Design and analysis of algorithms by V.V. Muniswamy. That's copyright infringement, so deleted. http://books.google.com/books?id=6eIPgTo8AaIC&pg=PA29&lpg=PA29&dq=%22In+average-case+analysis,+we+are+averaging+over+all+possible+inputs%22&source=bl&ots=shGN9VhF-X&sig=6voFhtpL8A8kzYV-GewTOZKRFVk&hl=en&sa=X&ei=-1YMULOyDeme2AW_2uHyDw&ved=0CDcQ6AEwAQ#v=onepage&q=%22In%20average-case%20analysis%2C%20we%20are%20averaging%20over%20all%20possible%20inputs%22&f=false 76.102.1.193 (talk) 19:53, 22 July 2012 (UTC)

Sigh. I note in the reviews for that book ... "V V Muniwamy is very good copy Master. He will just copy form differnet books and inform that he write the book. He is number one useless person. He cheated number of students in S V University, TPT". Whereever it ultimately came from, it's copyright violation. 76.102.1.193 (talk) 19:56, 22 July 2012 (UTC)
The fact that you were able to reproduce the entire work from Google Books: Fair use or copyright violation?--2001:18E8:3:104E:197F:49DD:AB15:A7EE (talk) 00:36, 18 February 2013 (UTC)

Possibly the rest of the page is copyright violation too. 76.102.1.193 (talk) 19:53, 22 July 2012 (UTC)

History[edit]

what is ment with probabilistic methods? i thought it's used to show existance, not runtime bounds? --141.53.220.223 (talk) 19:47, 11 July 2013 (UTC)

Confusing[edit]

The first few phrases fail to explain the subject. — Preceding unsigned comment added by Jangirke (talkcontribs) 02:13, 28 January 2014 (UTC)