Algorithms for Generating Small Random Samples
<|reference_start|>Algorithms for Generating Small Random Samples: We present algorithms for generating small random samples without replacement. We consider two cases. We present an algorithm for sampling a pair of distinct integers, and an algorithm for sampling a triple of distinct integers. The worst-case runtime of both algorithms is constant, while the worst-case runtimes of common algorithms for the general case of sampling $k$ elements from a set of $n$ increase with $n$. Java implementations of both algorithms are included in the open source library $\rho\mu$.<|reference_end|>
@article{cicirello2024algorithms,
    title={Algorithms for Generating Small Random Samples},
    author={Vincent A. Cicirello},
    journal={Software: Practice and Experience. 2024:1-9},
    year={2024},
    doi={10.1002/spe.3379},
    archivePrefix={arXiv},
    eprint={2405.12371},
    primaryClass={cs.DS cs.DM math.PR}
}