From ruzankin at math.nsc.ru  Wed Oct 18 16:43:02 2017
From: ruzankin at math.nsc.ru (Pavel S. Ruzankin)
Date: Wed, 18 Oct 2017 14:43:02 +0000
Subject: [Rd] uniform sampling without replacement algorithm
In-Reply-To: <20171018140447.GA23267@mail.cs.toronto.edu>
References: <20171018140447.GA23267@mail.cs.toronto.edu>
Message-ID: <21e282be-6e0a-4d2a-c01e-bc2d4f1e949d@math.nsc.ru>

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



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