Re: [Rd] uniform sampling without replacement algorithm

[Pavel S. Ruzankin]

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

______________________________________________
R-devel@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-devel