CacheDiff: Fast Random Sampling
arXiv:1512.00501
Abstract
We present a sampling method called, CacheDiff, that has both time and space complexity of O(k) to randomly select k items from a pool of N items, in which N is known.
arXiv:1512.00501
We present a sampling method called, CacheDiff, that has both time and space complexity of O(k) to randomly select k items from a pool of N items, in which N is known.