Abstract
Searching and sorting are two elementary topics of computer science in the field of algorithms and data structures. The Collections framework provides efficient implementations for both of them and thus takes a lot of work off your shoulders. However, understanding the underlying algorithms helps in choosing the most suitable variant for a particular use case. I only skim over the topic of searching here so please see my book Der Weg zum Java-Profi [Ind20a] for a more detailed treatment.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature
About this chapter
Cite this chapter
Inden, M. (2022). Searching and Sorting. In: Java Challenges. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7395-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4842-7395-1_10
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-7394-4
Online ISBN: 978-1-4842-7395-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)