Abstract
The efficiency of algorithms plays a central role in competitive programming. In this chapter, we learn tools that make it easier to design efficient algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Laaksonen, A. (2020). Efficiency. In: Guide to Competitive Programming. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-39357-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-39357-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39356-4
Online ISBN: 978-3-030-39357-1
eBook Packages: Computer ScienceComputer Science (R0)