Skip Navigation

The Computer Journal 1991 34(2):186; doi:10.1093/comjnl/34.2.186
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Campbell, D.
Right arrow Articles by McNeill, T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

Finding a majority when sorting is not available

D. Campbell * and T. McNeill

Computer Science Department, 230 TMCB, Brigham Young University, Provo, Utah 84602, USA

Let the abstract data type Object support an equivalence relation. This paper contains a fast, simple, space-frugal algorithm to determine whether a majority of an arbitrary set of such Objects belong to the same equivalence class (are the ‘same’) even when no total order is available for sorting and even if there are infinitely many different equivalence classes.

Received July 1989. revised November 1989.

* To whom correspondence should be addressed.

§ Computer Science Department, 230 TMCB, Brigham Young University, Provo, Utah 84602, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.