The majority package

[ Tags: algorithms, library, public-domain ] [ Propose Tags ]

The Boyer-Moore Majority Vote Algorithm determines if there in a list of votes is a candidate that holds more than half of the majority, and if so, finds this candidate. It does so in time linear in the length of the input list and constant memory. For a detailed description of the algorithm, see these papers:

• Wim H. Hesselink, "The Boyer-Moore Majority Vote Algorithm", 2005;

• Robert S. Boyer and J. Strother Moore, "MJRTY - A Fast Majority Vote Algorithm", 1982.

[Skip to Readme]

Properties

Versions 1.0, 1.1 haskell2010 [details] PublicDomain Nis N. Wegmann niswegmann@gmail.com Algorithms https://github.com/niswegmann/majority head: git clone https://github.com/niswegmann/majority.git Mon Jul 18 15:54:26 UTC 2011 by NisWegmann NixOS:1.1 642 total (27 in the last 30 days) (no votes yet) [estimated by rule of succession] λ λ λ Docs uploaded by userBuild status unknown Hackage Matrix CI

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for majority-1.0

[back to package description]

Majority

The Boyer-Moore Majority Vote Algorithm determines if there in a list of votes is a candidate that holds more than half of the majority, and if so, finds this candidate. It does so in time linear in the length of the input list and constant memory. For a detailed description of the algorithm, see these papers:

• Wim H. Hesselink, "/The Boyer-Moore Majority Vote Algorithm/", 2005;

• Robert S. Boyer and J. Strother Moore, "/MJRTY - A Fast Majority Vote Algorithm/",

Install

Assuming you have installed the Haskell Platform use cabal:

\$ cabal install majority


Bugs

Comments, bug reports, and patches will be much appreciated:

License

This library is distributed under a CC0 1.0 Universal Public Domain Dedication: