Author: J. Wesley Cleveland
Date: 12:20:26 10/19/99
Go up one level in this thread
On October 19, 1999 at 12:47:43, Dann Corbit wrote: >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. I came up with an even slower sort. while (!sorted) ;
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.