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. ...