© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022
R. WienerGeneric Data Structures and Algorithms in Gohttps://doi.org/10.1007/978-1-4842-8191-8_2

2. Algorithm Efficiency: Sorting and Searching

Richard Wiener1  
(1)
Colorado Springs, CO, USA
 

The previous chapter introduced generics and reviewed concurrency. We utilize both going forward in this chapter and the rest of the book.

The principal goal of this book is providing techniques based on data structures and algorithms for making programs run faster or in less space (more efficiently). The first question we address in this chapter is how we describe the efficiency of an algorithm. We then examine sorting and searching algorithms and examine their efficiency. ...

Get Generic Data Structures and Algorithms in Go: An Applied Approach Using Concurrency, Genericity and Heuristics now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.