From ruzankin at math.nsc.ru  Wed Oct 18 15:49:07 2017
From: ruzankin at math.nsc.ru (Pavel S. Ruzankin)
Date: Wed, 18 Oct 2017 13:49:07 +0000
Subject: [Rd] uniform sampling without replacement algorithm
In-Reply-To: <2209d0a9-3e02-00ec-b0e8-c36120b31f70@math.nsc.ru>
References: <2209d0a9-3e02-00ec-b0e8-c36120b31f70@math.nsc.ru>
Message-ID: <de9ea0aa-387a-e108-eaea-6684443d3e14@math.nsc.ru>

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



[Rd] uniform sampling without replacement algorithm
Pavel S. Ruzankin