Abstract
Searching data and sorting through data are fundamental algorithms. Searching refers to iterating over the data structure’s elements to retrieve some data. Sorting refers to putting the data structure’s elements in order. The searching and sorting algorithms are different for every data structure. This chapter focuses on searching and sorting for arrays. By the end of this chapter, you will understand how to use common sorting and searching algorithms for arrays.
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
© 2019 Sammie Bae
About this chapter
Cite this chapter
Bae, S. (2019). Searching and Sorting. In: JavaScript Data Structures and Algorithms. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3988-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3988-9_10
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3987-2
Online ISBN: 978-1-4842-3988-9
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books