Computer Chess Club Archives

Search

Messages

Subject: Re: Quriosity: SLOW way to sort :-)

Author: Dann Corbit

Date: 09:47:43 10/19/99

Go up one level in this thread

On October 19, 1999 at 07:51:27, Jari Huikari wrote:

>How to make the most ineffective sort? Here is one proposition:
>
>1. Randomly swap two members of the list
>2. if list is in order stop, else goto 1.
>
>Or try all (N!) possible orders, and choose the right one.
>
>May work fast anyway, if the list is short.
Over on news:comp.lang.c we call that bogosort.  Tom Torfs has written an
implementation and posted it there.  A million operations+ for ten items in a
list.

• 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

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.