A Convenient Algorithm for Drawing a Simple Random Sample

A. I. McLeod and D. R. Bellhouse

Journal of the Royal Statistical Society Series C, 1983, vol. 32, issue 2, 182-184

Abstract: A convenient one‐pass algorithm for drawing a simple random sample without replacement of size n from a population of N members, when N is initially unknown, is presented. Moreover, even when N is known, this algorithm appears to be more efficient than previously suggested algorithms when the entire population is stored in the fast memory of the computer. Applications to sampling from a computer file and to linear programming are briefly indicated.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.2307/2347297

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssc:v:32:y:1983:i:2:p:182-184

Ordering information: This journal article can be ordered from
http://ordering.onli ... 1111/(ISSN)1467-9876

Access Statistics for this article

Journal of the Royal Statistical Society Series C is currently edited by R. Chandler and P. W. F. Smith

More articles in Journal of the Royal Statistical Society Series C from Royal Statistical Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().