Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Big-O notation

Author: David Rasmussen

Date: 22:11:58 05/09/01

Go up one level in this thread


On May 09, 2001 at 09:53:21, Robert Hyatt wrote:

>On May 09, 2001 at 07:27:15, David Rasmussen wrote:
>
>>On May 09, 2001 at 02:00:25, Dann Corbit wrote:
>>
>>>For those of you who don't want to perform your own web search, just choose one
>>>of these:
>>>
>>>http://hissa.nist.gov/dads/HTML/bigOnotation.html
>>>http://bio5495.wustl.edu/textbook-html/node15.html
>>>http://umastr.math.umass.edu/~holden/Math136-99_projects/Amstutz-OBoyle-Petravage/big-o.html
>>>http://www.eecs.harvard.edu/~ellard/Q-97/HTML/root/node8.html
>>>http://classes.monterey.edu/CST/CST338-01/world/BigO.html
>>>http://shalim.csustan.edu/~john/Classes/CS3100_DataStructures/Previous_Semesters/1999_04_Fall/Examples/big-O
>>>
>>>CS:201, FCOL!
>>
>>Why are you posting this? This is basic computer science knowledge.
>
>
>Not to everyone, apparently.  :)
>
>Just flip down to the NP-complete/tree search thread...

*sigh*...

Why can't people understand that big O notation, little o notation and omega
notation are not the same, but they are all well defined. There is nothing to
discuss.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.