Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:15:23
Jim Gillogly (jim@acm.org)
Thu, 29 Oct 1998 20:04:57 -0800
On Thu, 29 Oct 1998, Greg Rose wrote:
> [A]nother, theoretically interesting, way to
> randomise is to take a sorting algorithm and make random binary choices
> everywhere it would compare two elements and swap them if out of order.
"David R. Conrad" <drc@adni.net> responded:
> The only caveat here is to make sure that this doesn't mung the operation
> of the sort.
One could modify Greg's suggestion slightly by attaching an auxiliary
array of 256 random numbers to each of the members of the original
array and then using the most efficient handy sort algorithm to sort
those random numbers, dragging along their associated original array
elements. This way it doesn't have a chance to interfere with the
operation of the sorting algorithm, at the cost of an extra array.
-- Jim Gillogly Trewesday, 9 Blotmath S.R. 1998, 04:00 12.19.5.11.11, 9 Chuen 4 Zac, Sixth Lord of Night
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:15:23