Runtime ...
from the OP
> > Both brute subroutines below aren't actually used: they are totally unusable for lists with ~15 unique strings or more, plus any decent amount of duplicates.
Your approach is even worse, instead of brute-forcing one random result, you try to brute-force all possible solutions in advance.
NB 15! = 1.3e12
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
In reply to Re^2: Algorithm RFC: fast (pseudo-)random shuffle with no repetition
by LanX
in thread Algorithm RFC: fast (pseudo-)random shuffle with no repetition
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |