Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 21:54:29 10/19/99

Go up one level in this thread


On October 19, 1999 at 23:40:52, Oliver Roese wrote:

>On October 19, 1999 at 22:43:57, Dann Corbit wrote:
>
>>On October 19, 1999 at 22:33:17, Oliver Roese wrote:
>>[snip]
>>>This is true, but already known from literature.
>>>The irritating point here was the usage of bubblesort instead of the highly
>>>favorated insertionsort.
>>And binary insertion sort is much faster than linear insertion sort (which for
>>some unknown reason is always favored).
>
>This is even more interesting.
>Can you cite some links?
Knuth, Donald, The Art of Computer Programming Volume 3, Sorting and Searching
1998, pp 82-3, 97, 183, 186, 193, 225, 386
I don't think you will find it on the net anywhere, despite it being very
straightforward.  I am writing a chapter for a C book right now (my chapter is
on sorting) and I am developing it in detail.

I've never seen any implementation of it except the ones that I have written.
It is considerably faster than linear insertion for any set size and gains
advantage with increasing size.



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.