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:


Properties

Versions1.0, 1.1
Dependencieshaskell2010
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
Upload dateMon Jul 18 15:57:23 UTC 2011
Uploaded byNisWegmann
Downloads168 total (16 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees