Abstract
FORTRAN code that implements an algorithm for selecting equal probability samples is given. The procedure is brief and decides to include or not include a record as it is called. Consequently, storage requirements are minimal. The procedure gives the exact number of values specified, with each record in the population having an equal probability for inclusion in the sample, including the last.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
IBM. Scientific Subroutine Package. White Plains, N.Y: International Business Machines Corp., 1969, Manual H 20-0205-3.
KNUTH, D.The art of computer programming. Vol. 2. Seminumerical algorithms. Reading: Addison & Wesley, 1969.
LEHMAN, R., & BAILEY, D.Digital computing: Fortran IV and its applications in behavioral science. New York: Wiley, 1968.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Walsh, J.F. An efficient procedure for selecting equal probability samples. Behav. Res. Meth. & Instru. 3, 212 (1971). https://doi.org/10.3758/BF03208140
Issue Date:
DOI: https://doi.org/10.3758/BF03208140