RandomSubset - random subset of an array without repetition
rng array int RandomSubset -> array
rng [5 7 2 9 1 6 8] 3 RandomSubset --> [2 7 5]
rng [5 7 2 9 1 6 8] 3 RandomSubset --> [6 8 7]
rng [5 7 2 ] 3 RandomSubset --> [7 2 5]
rng [5 7 2 ] 3 RandomSubset --> [5 2 7]
rng a n RandomSubset returns an array of size
n with elements randomly select from array a.
Selection is made without repetitions.
Therefore,
a length n geq
is required.
rng, random number generator
not yet protected by trie
Skiena, Steven S. (1990)
Implementing discrete Mathematics: combinatorics and
graph theory with Mathematica.
Addison-Wesley, Redwood City.
Diesmann
4.5.2001
/var/www/debian/nest/nest-simulator-2.20.0/lib/sli/librandom.sli