An efficient algorithm for random sampling without replacement

  • P. Gupta
  • G. P. Bhattacharjee
Session 7 Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


An algorithm for drawing a random sample of size M from the population of size N (M≤N) has been proposed. The algorithm has the time complexity of MIN {O(Mlog2M), O[(N−M)log2(N−M)]} and the space complexity of O(M).


Efficient Algorithm Space Complexity Storage Location Random Integer Balance Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ernvall J. and O. Nevalainen, An Efficient Algorithm For Unbiased Random Sampling, Computer J., Vol. 25, No. 1, pp. 45–47, 1982.Google Scholar
  2. [2]
    Fan C.T., M.E. Muller and Ivan Rezucha, Development of Sampling Plans By Using Sequential (Item by Item) Selection Techniques And Digital Computers, JASA, Vol. 57, No. 298, pp. 387–402, 1962.Google Scholar
  3. [3]
    Goodman S.E. and S.T. Hedetniemi, Introduction To The Design And Analysis Of Algorithm, McGraw Hill, 1977.Google Scholar
  4. [4]
    Gupta P. and G. P. Bhattacharjee, Parallel Generation Of Permutations, Computer J., Vol. 26, No. 2, pp. 97–105, 1983.Google Scholar
  5. [5]
    Knuth D.E., The Art of Computer Programming, Vol. 2 (Seminumerical algorithms), Addison-Wesley Pub., (Reading Mass), 1981.Google Scholar
  6. [6]
    Teuhola J. and O. Nevalainen, Two Efficient Algorithms For Random Sampling Without Replacement, IJCM, Vol. 11, No. 2, pp. 127–140, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • P. Gupta
    • 1
  • G. P. Bhattacharjee
    • 2
  1. 1.IPAD/RSA Space Applications Centre (ISRO)AhmedabadIndia
  2. 2.Department of MathematicsIndian Institute of TechnologyKharagpurIndia

Personalised recommendations