Table of Contents for
Grokking Algorithms: An illustrated guide for programmers and other curious people
Grokking Algorithms: An illustrated guide for programmers and other curious people
Published by
Manning Publications, 2016
- Cover
- Grokking Algorithms: An illustrated guide for programmers and other curious people
- 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
Table of Contents
Chapter 1. Introduction to Algorithms
Algorithm running times grow at different rates
Visualizing different Big O run times
Chapter 6. Breadth-first Search
Chapter 7. Dijkstra’s algorithm
The classroom scheduling problem
Chapter 9. Dynamic programming
What happens if you change the order of the rows?
Can you fill in the grid column-wise instead of row-wise?
What happens if you add a smaller item?
Can you steal fractions of an item?
Optimizing your travel itinerary
Handling items that depend on each other
Is it possible that the solution will require more than two sub-knapsacks?
Is it possible that the best solution doesn’t fill the knapsack completely?
Chapter 10. K-nearest neighbors
Classifying oranges vs. grapefruit
Building a recommendations system
Introduction to machine learning