Abstract
This chapter introduces the most important data structures of the C\(++\) standard library. In competitive programming, it is crucial to know which data structures are available in the standard library and how to use them. This often saves a large amount of time when implementing an algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The worst-case time complexity of the operations is O(n), but this is very unlikely to occur.
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). Data Structures. In: Guide to Competitive Programming. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-39357-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-39357-1_5
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)