The majority package

[Tags: library, public-domain]

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:


[Skip to ReadMe]

Properties

Versions1.0, 1.1
Change logNone available
Dependencieshaskell2010 [details]
LicensePublicDomain
AuthorNis N. Wegmann
Maintainerniswegmann@gmail.com
Stabilityprovisional
CategoryAlgorithms
Home pagehttps://github.com/niswegmann/majority
Source repositoryhead: git clone https://github.com/niswegmann/majority.git
UploadedMon Jul 18 15:54:26 UTC 2011 by NisWegmann
DistributionsNixOS:1.1
Downloads382 total (22 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for majority-1.0

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:

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: