"An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"--
"An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"--Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Dr. Daniel Zingaro is an award-winning associate professor of mathematical and computational sciences at the University of Toronto Mississauga. He is well known for his uniquely interactive approach to teaching and internationally recognized for his expertise in active learning. He is also the author of Learn to Code by Solving Problems (No Starch Press) and co-author of Learn AI-Assisted Python Programming.
Inhaltsangabe
Foreword Introduction Acknowledgments Chapter 1: Hash Tables Chapter 2: Trees and Recursion Chapter 3: Memoization and Dynamic Programming Chapter 4: Advanced Memoization and Dynamic Programming Chapter 5: Graphs and Breadth-First Search Chapter 6: Shortest Paths in Weighted Graphs Chapter 7: Binary Search Chapter 8: Heaps and Segment Trees Chapter 9: Union-Find Chapter 10: Randomization Afterword Appendix A: Algorithm Runtime Appendix B: Because I Can’t Resist Appendix C: Problem Credits Index