The de-facto unbiased shuffle algorithm is the Fisher-Yates (aka Knuth) Shuffle.
https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
Shuffled array.
Array with any values will be shuffled in the first dimension.
Generated using TypeDoc
The de-facto unbiased shuffle algorithm is the Fisher-Yates (aka Knuth) Shuffle.
See
https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
Returns
Shuffled array.