Author: Robert Hyatt
Date: 08:48:20 05/09/01
Go up one level in this thread
On May 09, 2001 at 11:27:46, Dann Corbit wrote: >But WAIT! That's just a constant. A rather large constant, but a constant >none-the-less. Hence our running time is O(1). >Q.E.D. > >FOR CRYING OUT LOUD! > >And happy sorting. >[snip] I snipped the cute sort. I'm surprised I haven't seen that turned in by a student yet.. :) I think the argument is hopeless. Until someone has gone through a theory class to understand the complexity issue, the argument is going to go around in circles.
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.