The majority package
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.
- No changelog available
Properties
| Versions | 1.0, 1.1 |
|---|---|
| Dependencies | haskell2010 |
| License | PublicDomain |
| Author | Nis N. Wegmann |
| Maintainer | niswegmann@gmail.com |
| Stability | provisional |
| Category | Algorithms |
| Home page | https://github.com/niswegmann/majority |
| Source repository | head: git clone https://github.com/niswegmann/majority.git |
| Uploaded | Mon Jul 18 15:57:23 UTC 2011 by NisWegmann |
| Distributions | NixOS:1.1 |
| Downloads | 278 total (17 in last 30 days) |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Modules
- Algorithms
[Index]
Downloads
- majority-1.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
Maintainers' corner
For package maintainers and hackage trustees