Given an input seed, how could I generate a list of non-redundant indices from 0 to N in random order? The numbers need to span the range 0 to N inclusively with a total of N numbers in random order.
I'd like an efficient method as I don't think, filling an array with values from 0 to N with N digits, then randomizing them is all that efficient...
Aucun commentaire:
Enregistrer un commentaire