[Rd] uniform sampling without replacement algorithm

Pavel S. Ruzankin ruzankin at math.nsc.ru
Wed Oct 18 16:43:02 CEST 2017

Previous message (by thread): [Rd] uniform sampling without replacement algorithm
Next message (by thread): [Rd] uniform sampling without replacement algorithm
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Thank you for your answer. Certainly, hash table must be faster than 
binary tree.

Previous message (by thread): [Rd] uniform sampling without replacement algorithm
Next message (by thread): [Rd] uniform sampling without replacement algorithm
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the R-devel mailing list