[Rd] uniform sampling without replacement algorithm

[Pavel S. Ruzankin]

See also:
P. Gupta, G. P. Bhattacharjee. (1984) An efficient algorithm for random 
sampling without replacement. International Journal of Computer 
Mathematics 16:4, pages 201-209.
http://dx.doi.org/10.1080/00207168408803438

Teuhola, J. and Nevalainen, O. 1982. Two efficient algorithms for random 
sampling without replacement. /IJCM/, 11(2): 127–140.
http://dx.doi.org/10.1080/00207168208803304

In the latter paper the authors claim that their algorithms have O(s) 
complexity. I doubt that this statement is correct. Is it?


	[[alternative HTML version deleted]]