Head First Algorithms and Data Structures

Chapter 8. Greedy Algorithms: Being Greedy

A Note for Early Release Readers

With Early Release ebooks, you get books in their earliest form—the author’s raw and unedited content as they write—so you can take advantage of these technologies long before the official release of these titles.

This will be the 8th chapter of the final book.

If you’d like to be actively involved in reviewing and commenting on this draft, please reach out to the editor at [e-mail].

Sometimes the smartest strategy is to focus on what looks best right now. Think of an all-you-can-eat buffet: you head straight for the prime rib, the fresh crab legs, the perfectly crispy bacon. You don’t start by sampling everything—you grab what clearly has the most value. That’s how greedy algorithms work. At each step, they choose the option that seems best at the moment, working to build a great overall result from a series of strong local decisions. And often, this works beautifully; greedy algorithms can be fast, simple, and surprisingly powerful. But this approach has limits. In some problems, focusing only on the immediate best choice can block better outcomes later. In this chapter, you’ll learn when greedy algorithms are exactly the right tool, and when you need a strategy that looks further ahead.

What does it mean to be greedy?

Let’s talk about a strategy you probably already use without realizing ...