RandomSubset


Name:
RandomSubset - random subset of an array without repetitions
Synopsis:
rng array int RandomSubset -> array  

Examples:
 
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]

Description:
 
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.
Parameters:
 
rng, random number generator
Bugs:
 
not yet protected by trie
References:
 
Skiena, Steven S. (1990)
Implementing discrete Mathematics: combinatorics and
graph theory with Mathematica.
Addison-Wesley, Redwood City.
Author:
Diesmann  
FirstVersion:
4.5.2001  
SeeAlso: Source:
/home/graber/work-nest/nest-git/nest-simulator/lib/sli/librandom.sli