{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/majority","name":"majority","description":"The Boyer-Moore Majority Vote Algorithm determines if there in a list of votes\nis a candidate that holds more than half of the majority, and if so, finds\nthis candidate. It does so in time linear in the length of the input list and\nconstant memory. For a detailed description of the algorithm, see these papers:\n\nWim H. Hesselink,\n\"The Boyer-Moore Majority Vote Algorithm\",\n2005;\n\nRobert S. Boyer and J. Strother Moore,\n\"MJRTY - A Fast Majority Vote Algorithm\",\n1982.","version":"1.1","softwareVersion":"1.1","license":"https://spdx.org/licenses/Other","codeRepository":"https://github.com/niswegmann/majority","url":"https://github.com/niswegmann/majority","keywords":["algorithms","library","public-domain","Propose Tags"],"maintainer":[{"@type":"Person","name":"NisWegmann"}],"author":[{"@type":"Person","name":"NisWegmann"}],"copyrightHolder":[{"@type":"Person","name":"NisWegmann"}],"dateCreated":"2011-07-18","dateModified":"2011-07-18","datePublished":"2011-07-18","copyrightYear":2011,"downloadUrl":"https://hackage.haskell.org/package/majority-1.1/majority-1.1.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/majority"]}