Wikipedia's expln (added 10 years ago today: https://en.wikipedia.org/w/index.php?title=Fisher%E2%80%93Yates_shuffle&diff=150258692&oldid=150182962 …) isn't great, but your appendix turns it even worse by writing σ as ? 
Why does Sattolo's algorithm produce a permutation with exactly one cycle? http://danluu.com/sattolo/
-
-
-
Thanks for catching that! I think this is some issue with pasting unicode into tmux/emacs :-(. Will try to fix shortly.
- 2 more replies
New conversation -
-
-
I needed to do this recently (to shuffle test execution in greatest) without using dynamic allocation. I used a linear congruential PRNG.
-
The implementation is here: https://github.com/silentbicycle/greatest/blob/develop-random-order/greatest.h#L993-L1023 … (dev branch, should be in a new release later this week)
End of conversation
New conversation -
-
-
I don't understand your Fisher-Yates output probability analysis: since we always swap a[i] with a[j>i], a[i'] != a[i].
-
and a[0] has n-1 choices, a[1] has n-2, etc, so the finally outcome count should be (n-1)!.
- 2 more replies
New conversation -
-
-
@JohnDCook you might like thisThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Typo: "On the first iteration, we [fix] one…"
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.