Computer Chess Club Archives

Search

Messages

Subject: Quriosity: SLOW way to sort :-)

Author: Jari Huikari

Date: 04:51:27 10/19/99

Go up one level in this thread

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.

					Jari

• 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

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.