Fisher–Yates shuffle - Wikipedia

Example of shuffling five letters using Durstenfeld's in-place version of the Fisher–Yates shuffle The Fisher–Yates shuffle is an algorithm for shuffling a finite sequence. The algorithm takes a list of all the elements of the sequence, and continually determines the next element in the shuffled sequence by randomly drawing an element from the list until no elements remain.[1] The algorithm produc

[ohnishiakira]

“an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set”

[tomio2480]

Modulo bias を調べて辿りついた

[tom_k-0710]

Fisher–Yates shuffleで配列をシャッフルする

[banjun]

シャッフル

[emonkak]

配列をシャッフルする時に使う

[shiumachi]

ランダムに並べ替える、シャッフリングのアルゴリズム。