Author: Jeremiah Penery
Date: 11:19:01 05/09/01
Go up one level in this thread
On May 09, 2001 at 14:07:11, Dann Corbit wrote: >On May 09, 2001 at 14:02:05, Jeremiah Penery wrote: >[snip] >>I'll go to Dann's BogoSort example. If I give it input of 5 numbers, are you >>going to tell me the _algorithm_ is O(1)? O-notation is used to estimate >>worst-case running time _based on the size of the input_! It has nothing to do >>with the specific number/size of inputs you choose. Bogosort seems clearly >>O(n!), whether any specific input size is finite or not! > >HOORAY! The whole discussion was worthwhile, because somebody got something out >of it. >;-) > >Actually, I think you may have already known it. >:-( Actually, I didn't really know it. I have had a minute amount of work with O-notation before, but not enough to be worth anything. It just seems fairly obvious this this is the way it is. >Sigh. I definitely need to work on my teaching skills. Not at all. :) I, at least, understand you perfectly. O-notation doesn't depend on the size of the input itself, but the relationship between input size and output speed. Simple as that. :)
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.