|Sent on:||Friday, November 8, 2013 9:23 AM|
It might be worth looking up the statute for the actual algorithm. For example, if the bottom three candidates have X, Y, and Z votes, and Y + Z < X, then both Y and Z can be eliminated in one round. (That's not the full detail of the rule, just a case I know offhand because it happened twice in the mayoral count.)
- Create a data structure that represents a ballot with a 1st, 2nd, and 3rd choice for office
- Count up the number of 1st choice votes for each candidate. If a candidate has 50% + 1 votes, declare that candidate the winner.
- Else, select the candidate with the lowest number of 1st choice votes, pop the 1st choice off of any ballot for which that candidate was the first choice, and remove that candidate from all other ballots.
Please Note: If you hit "REPLY", your message will be sent to everyone on this mailing list ([address removed])
To learn more about Bill Bushey, visit his/her member profile
To report abuse or block this person, please click here
Set my mailing list to email me As they are sent | In one daily email | Don't send me mailing list messages
Meetup, POB 4668 #37895 NY NY USA 10163 | [address removed]