Author: leonid
Date: 18:02:01 10/18/99
Go up one level in this thread
On October 18, 1999 at 19:06:52, leonid wrote: >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 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 sound to me more attractive that I expected. I tryed before to find >something about this method through Alta Vista but fail. If somebody could >indicate the place where this idea is explained, it will be very helpful. > >Thanks, >Leonid. Already went to see what is the "bubble sort" through the Alta Vista. This time I not only found very quickly what it is but even found that I have used this method for a long time. Surprise, surprise! Leonid.
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.