But why combine an O( N! ) algorithm with an O(N log N) algorithm, when Fischer-Yates is O(N)?
List::Util::shuffle() does a million 4 way shuffles in less than 1 second.
In reply to Re^4: Randomly select values from array
by BrowserUk
in thread Randomly select values from array
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |