In this chapter the author explains a clever approach to determining the winner of an election, and in so doing he demonstrates the following lessons: the most straightforward solution to a problem is not always the fastest one; often there are clever algorithms that can solve the same task with much less effort; it is not always easy to see whether an algorithm produces the correct result for every possible input; and sometimes one can prove that for a problem it is impossible to find an algorithm that is better than the one we already have. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Erlebach, T. (2011). Majority - Who gets elected class rep? In Algorithms Unplugged (pp. 239–247). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_24
Mendeley helps you to discover research relevant for your work.