On computing majority by comparisons


The elements of a finite setX (of odd cardinalityn) are divided into two (as yet unknown) classes and a member of the larger class is to be identified. The basic operation is to test whether two objects are in the same class. We show thatn-B(n) comparisons are necessary and sufficient in worst case, whereB(n) is the number of 1's in the binary expansion ofn.

This is a preview of subscription content, access via your institution.


  1. [1]

    M. R. Best, P. van Emde Boas, andH. W. Lenstra,Jr.: A sharpened version of the Anaderaa-Rosenberg conjecture,Math. Centrum, Amsterdam 1974.

  2. [2]

    B. Bollobás:Extremal Graph Theory, Academic Press, 1978.

  3. [3]

    M. J. Fisher, andS. L. Salzberg: Finding a majority amongn voters,Journal of Algorithms,3 (1982), 375–379.

    Google Scholar 

  4. [4]

    J. Misra, andD. Gries: Finding repeated elements,Science of Computer Programming,2 (1982), 143–152.

    Google Scholar 

  5. [5]

    R. Rivest, andJ. Viullemin: On recognizing graph properties from adjacency matrices.Theor. Comp. Sci. 3 (1976/77), 371–384.

    Google Scholar 

Download references

Author information



Additional information

Supported in part by NSF grant DMS87 03541 and Air Force Office of Scientific Research grant AFOSR-0271.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Saks, M.E., Werman, M. On computing majority by comparisons. Combinatorica 11, 383–387 (1991). https://doi.org/10.1007/BF01275672

Download citation

AMS subject classification (1991)

  • 68 P 10
  • 68 R 05