On computing majority by comparisons

Michael E. Saks*, Michael Werman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

62 Scopus citations

Abstract

The elements of a finite set X (of odd cardinality n) 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 that n-B(n) comparisons are necessary and sufficient in worst case, where B(n) is the number of 1's in the binary expansion of n.

Original languageAmerican English
Pages (from-to)383-387
Number of pages5
JournalCombinatorica
Volume11
Issue number4
DOIs
StatePublished - Dec 1991
Externally publishedYes

Keywords

  • AMS subject classification (1991): 68P10, 68R05

Fingerprint

Dive into the research topics of 'On computing majority by comparisons'. Together they form a unique fingerprint.

Cite this