In this note, an efficient method for weighted sampling of K objects without replacement from a population of n objects is proposed. The method requires O(Klog n) additions and comparisons, and $O(K)$ multiplications and random number generations while the method proposed by Fagin and Price requires $O(Kn)$ additions and comparisons, and $O(K)$ divisions and random number generations.
No takes yet. Share an insight, caveat, or question.
Wong et al. (1980) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: