[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Chicken-users] Efficient shuffle algorithm
|
From: |
Alex Shinn |
|
Subject: |
Re: [Chicken-users] Efficient shuffle algorithm |
|
Date: |
Tue, 01 Feb 2005 19:40:52 -0600 |
|
User-agent: |
Wanderlust/2.10.1 (Watching The Wheels) SEMI/1.14.6 (Maruoka) FLIM/1.14.6 (Marutamachi) APEL/10.6 Emacs/21.3 (i386-pc-linux-gnu) MULE/5.0 (SAKAKI) |
At Mon, 31 Jan 2005 14:53:22 +0000, joel reymont wrote:
>
> How would I efficiently implement this algorithm on a list?
>
> START WITH FRESH DECK
> GET RANDOM SEED
> FOR CT = 1, WHILE CT <= 52, DO
> X = RANDOM NUMBER BETWEEN CT AND 52 INCLUSIVE
> SWAP DECK[CT] WITH DECK[X]
You can't, that's a vector algorithm, and would be horribly slow on a
list.
Check out
http://groups-beta.google.com/group/comp.lang.scheme/browse_frm/thread/24270db01f684439/e54c99564028efec
--
Alex
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- Re: [Chicken-users] Efficient shuffle algorithm,
Alex Shinn <=