Author: Dann Corbit
Date: 11:07:11 05/09/01
Go up one level in this thread
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. :-( Sigh. I definitely need to work on my teaching skills.
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.