MJRTY - A Fast Majority Vote Algorithm.

Abstract

A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an efficient use of magnetic tape. A FORTRAN version of the algorithms is exhibited. The FORTRAN code has been proved correct by a mechanical verification system for FORTRAN. The system and the proof are discussed. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1981
Accession Number
ADA131702

Entities

People

  • J. Strother Moore
  • Robert S. Boyer

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Advanced Electronics

DTIC Thesaurus Topics

  • Algorithms
  • Analyzers
  • Arithmetic
  • Batch Processing
  • Computer Science
  • Computers
  • Contracts
  • Errors
  • Governments
  • Language
  • Military Research
  • Reliability
  • Specifications
  • Standards
  • Systems Science
  • United States
  • United States Government

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Science.
  • Polymer Science and Engineering.