Re^2: A bad shuffle

No, you're wrong. It looks like Fisher-Yates, but there's a slight difference, in that all his array items can move again on every loop. His "correct algorithm" is actually Fisher-Yates, where per loop, one item gets moved into its final position.

Comment on Re^2: A bad shuffle

Replies are listed 'Best First'.
Re^3: A bad shuffle by Anonymous Monk on Mar 21, 2005 at 15:47 UTC
Sorry Bart, I thouht you were replying to me...	[reply]
Re^4: A bad shuffle by Anonymous Monk on Mar 21, 2005 at 16:12 UTC
No, clearly his remarks were intended for me, not you.	[reply]
Re^3: A bad shuffle by Anonymous Monk on Mar 21, 2005 at 14:56 UTC
Bart, That's what I said ;-) Please re-read the node you are replying to. I said the "original ... is not a Fisher-Yates..." and "The final is a correct Fisher-Yates..." - which is exactly what you are asserting now.	[reply]