[Rd] uniform sampling without replacement algorithm

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


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



More information about the R-devel mailing list