Grokking Algorithms Aditya Bhargava An Illustrated Guide For Programmers And Other Curious People Manning
Aditya%20Bhargava-Grokking%20Algorithms_%20An%20Illustrated%20Guide%20for%20Programmers%20and%20Other%20Curious%20People-Manning
User Manual:
Open the PDF directly: View PDF
Page Count: 258 [warning: Documents this large are best viewed by clicking the View PDF Link!]
- Cover
- 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
- The knapsack problem
- Knapsack problem FAQ
- What happens if you add an item?
- What happens if you change the order of the rows?
- Can you fill in the grid column-wise insteadof 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 requiremore than two sub-knapsacks?
- Is it possible that the best solution doesn’tfill the knapsack completely?
- Longest common substring
- Recap
- Chapter 10 K-nearestneighbors
- Chapter 11 Where to Go Next
- Answers to Exercises
- Index