Grokking Algorithms

Chapter 11. Where to go next

In this chapter

• You get a brief overview of 10 algorithms that weren’t covered in this book, and why they’re useful.
• You get pointers on what to read next, depending on what your interests are.

Trees

Let’s go back to the binary search example. When a user logs in to Facebook, Facebook has to look through a big array to see if the username exists. We said the fastest way to search through this array is to run binary search. But there’s a problem: every time a new user signs up, you insert their username into the array. Then you have to re-sort the array, because binary search only works with sorted arrays. Wouldn’t ...