Simple, Optimal Algorithms for Random Sampling Without Replacement
Data Structures and Algorithms
2021-04-13 v1 Computation
Abstract
Consider the fundamental problem of drawing a simple random sample of size k without replacement from [n] := {1, . . . , n}. Although a number of classical algorithms exist for this problem, we construct algorithms that are even simpler, easier to implement, and have optimal space and time complexity.
Cite
@article{arxiv.2104.05091,
title = {Simple, Optimal Algorithms for Random Sampling Without Replacement},
author = {Daniel Ting},
journal= {arXiv preprint arXiv:2104.05091},
year = {2021}
}