Author: Jeremiah Penery
Date: 16:49:30 10/18/99
Go up one level in this thread
On October 18, 1999 at 17:28:12, Oliver Roese wrote: >On October 18, 1999 at 16:48:51, leonid wrote: > >>On October 18, 1999 at 14:03:49, KarinsDad wrote: >> >>>On October 16, 1999 at 07:59:32, leonid wrote: >(...) >>>>If somebogy will mention what is the "bubble sort" it will be appreciated. >>>> >>>>Leonid. > >(...Explanation) >> >>Thanks for responding! >> >(...) > > >BTW, by glancing through an older crafty version This is in even the new Crafty versions. :) It says: /* ---------------------------------------------------------- | | | don't disdain the lowly bubble sort here. the list of | | captures is always short, and experiments with other | | algorithms are always slightly slower. | | | ---------------------------------------------------------- */ > i stumpeld across a remarkable >comment there. Dr. Hyatt says there, that Bubblesort has outperformed all other >sortalgorithms for a particular sortproblem! >This is amazing, since AFAIK Bubblesort is the one documented sort-algorithm >that is theoretically dominated by any other documented sort-algorithm. >Consequently it is doomed by many as the "poor-mans-sort." >Since i assume Dr. Hyatt knows what he say, we have a counterexample. >Is there a explanation to that? > >Best Regards >Oliver
This page took 0.01 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.