Skip to main content

Majority - Who Gets Elected Class Rep?

  • Chapter
Algorithms Unplugged
  • 12k Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Erlebach, T. (2011). Majority - Who Gets Elected Class Rep?. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15328-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15327-3

  • Online ISBN: 978-3-642-15328-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics