Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast sort? - Bubble Sort!? (Question to Dr. Hyatt)

Author: Robert Hyatt

Date: 07:36:40 10/23/99

Go up one level in this thread


On October 22, 1999 at 10:03:29, Dann Corbit wrote:

>Change to binary insertion and you will see a much bigger benefit.

I tried both (from Knuth Sorting and Searching).  Binary is very bad for
lists that have 1-5 entries max.  from testing on my machine.  Simple
insertion is no faster than the bubble sort I used, but it also turns out
to be no slower either, after testing Crafty over 300 different positions.

I think I'll leave insertion in, to prevent such discussions in the
future, however.  :)



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.