As you may have guessed, this book talks quite a bit about data structures and algorithms. But more specifically, the book is laid out as follows:
In Chapter 1, Why Data Structures Matter and Chapter 2, Why Algorithms Matter, we explain what data structures and algorithms are, and explore the concept of time complexity—which is used to determine how efficient an algorithm is. In the process, we also talk a great deal about arrays, sets, and binary search.
In Chapter 3, Oh Yes! Big O Notation, we unveil Big O Notation and explain it in terms that my grandmother could understand. We’ll use this notation throughout the book, so this chapter is pretty important.
In Chapter 4, Speeding Up Your Code with Big O, Chapter ...