Book description
Grokking Algorithms is a friendly take on this core computer science topic. In it, you'll learn how to apply common algorithms to the practical programming problems you face every day. You'll start with tasks like sorting and searching. As you build up your skills, you'll tackle more complex problems like data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.
Table of contents
- Copyright
- Brief Table of Contents
- Table of Contents
- Preface
- Acknowledgments
- About this Book
- Chapter 1. Introduction to Algorithms
- Chapter 2. Selection Sort
- Chapter 3. Recursion
- Chapter 4. Quicksort
- Chapter 5. Hash Tables
- Chapter 6. Breadth-first Search
- Chapter 7. Dijkstra’s algorithm
- Chapter 8. Greedy algorithms
- Chapter 9. Dynamic programming
- Chapter 10. K-nearest neighbors
- Chapter 11. Where to go next
- Appendix. Answers to Exercises
- Index
Product information
- Title: Grokking Algorithms
- Author(s):
- Release date: May 2016
- Publisher(s): Manning Publications
- ISBN: 9781617292231
You might also like
book
Refactoring: Improving the Design of Existing Code
Fully Revised and Updated–Includes New Refactorings and Code Examples “Any fool can write code that a …
book
Deciphering Data Architectures
Data fabric, data lakehouse, and data mesh have recently appeared as viable alternatives to the modern …
book
Fluent React
When it comes to building user interfaces on the web, React enables web developers to unlock …
book
Modern Software Engineering: Doing What Works to Build Better Software Faster
Improve Your Creativity, Effectiveness, and Ultimately, Your Code In Modern Software Engineering, continuous delivery pioneer David …
