Computer Chess Club Archives

Search

Messages

Subject: Re: Fast way to sort moves in movelist ?

Author: Ricardo Gibert

Date: 17:39:26 10/18/99

Go up one level in this thread

On October 18, 1999 at 13:49:26, Dann Corbit wrote:

>On October 17, 1999 at 17:07:30, Ricardo Gibert wrote:
>[snip]
>>>And bubblesort has the advantage of being the best algorithm to sort already
>>>ordered lists.
>>
>>Shaker sort does this faster.
>Linear insertion is also faster and binary insertion even faster.  Quick sort
>with Singleton's modification should not be used for partitions smaller than 20
>elements.

"Quick sort with Singleton's modification" sounds a little like a couple of
algorithms I've come up with for this task. Could you give a brief description?
Thanks in advance.

• Re: Fast way to sort moves in movelist ? Dann Corbit 18:15:52 10/18/99
  • Re: Fast way to sort moves in movelist ? Ricardo Gibert 18:25:16 10/18/99
    • Re: Fast way to sort moves in movelist ? Dann Corbit 18:45:01 10/18/99
      • Quriosity: SLOW way to sort :-) Jari Huikari 04:51:27 10/19/99
        • Re: Quriosity: SLOW way to sort :-) Tord Romstad 13:18:11 10/20/99
          • Re: Quriosity: SLOW way to sort :-) Tord Romstad 13:29:06 10/20/99
        • Re: Quriosity: SLOW way to sort :-) Dann Corbit 09:47:43 10/19/99
          • Re: Quriosity: SLOW way to sort :-) J. Wesley Cleveland 12:20:26 10/19/99
            • Re: Quriosity: SLOW way to sort :-) Dann Corbit 13:37:15 10/19/99
              • Sortdemo (Java) having bogosort too Jari Huikari 06:53:40 10/20/99
              • Re: Quriosity: SLOW way to sort :-) Jari Huikari 05:01:33 10/20/99
      • Re: Fast way to sort moves in movelist ? Ricardo Gibert 21:08:24 10/18/99

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.