Author: Dann Corbit
Date: 10:59:35 05/09/01
Go up one level in this thread
On May 09, 2001 at 13:57:06, Ricardo Gibert wrote: [snip] >It's a lost cause. he keeps comparing apples with oranges. In chess n is a >constant. In a sorting algorithm it is unbounded. Hopeless. The two of you have a very interesting definition for O(f(n)), not shared by anyone in the industry. It is hopeless to convince me because I am right and you are wrong. You don't understand algorithm analysis.
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.