Analysis of Boyer and Moore's MJRTY algorithm

Given a set of n elements each of which is either red or blue, Boyer and Moore@?s MJRTY algorithm uses pairwise equal/not equal color comparisons to determine the majority color. We analyze the average behavior of their algorithm, proving that if all 2^n possible inputs are equally likely, the average number of color comparisons used is n-2n/@p+O(1) with variance (@p-2)n/@p-2n/@p+O(1).

[1]  Michael Werman,et al.  On computing majority by comparisons , 1991, Comb..

[2]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[3]  Robert S. Boyer,et al.  MJRTY: A Fast Majority Vote Algorithm , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.

[4]  René Schott,et al.  The Average-Case Complexity of Determining the Majority , 1997, SIAM J. Comput..

[5]  Edward M. Reingold,et al.  Determining the Majority , 1993, Inf. Process. Lett..

[6]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..