Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
57,40 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Kategorien:
Beschreibung
"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"--
Über den Autor
Daniel Zingaro
Inhaltsverzeichnis
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
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
Details
Erscheinungsjahr: | 2024 |
---|---|
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9781718503229 |
ISBN-10: | 1718503229 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Zingaro, Daniel |
Auflage: | 2nd Edition |
Hersteller: |
Random House LLC US
No Starch Press |
Verantwortliche Person für die EU: | Springer Fachmedien Wiesbaden GmbH, Postfach:15 46, D-65189 Wiesbaden, info@bod.de |
Maße: | 236 x 178 x 29 mm |
Von/Mit: | Daniel Zingaro |
Erscheinungsdatum: | 23.01.2024 |
Gewicht: | 0,898 kg |
Über den Autor
Daniel Zingaro
Inhaltsverzeichnis
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
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
Details
Erscheinungsjahr: | 2024 |
---|---|
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9781718503229 |
ISBN-10: | 1718503229 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Zingaro, Daniel |
Auflage: | 2nd Edition |
Hersteller: |
Random House LLC US
No Starch Press |
Verantwortliche Person für die EU: | Springer Fachmedien Wiesbaden GmbH, Postfach:15 46, D-65189 Wiesbaden, info@bod.de |
Maße: | 236 x 178 x 29 mm |
Von/Mit: | Daniel Zingaro |
Erscheinungsdatum: | 23.01.2024 |
Gewicht: | 0,898 kg |
Sicherheitshinweis