46,95 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Topics and features: introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms; compatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structures; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; reviews the features of the C++ programminglanguage, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; describes a selection of more advanced topics, including square-root algorithms and dynamic programming optimization.
Fully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.
Topics and features: introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms; compatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structures; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; reviews the features of the C++ programminglanguage, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; describes a selection of more advanced topics, including square-root algorithms and dynamic programming optimization.
Fully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.
Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland. He has served as one of the organizers of the Finnish Olympiad in Informatics since 2008, and as the Scientific Chair of the Baltic Olympiad in Informatics in 2016. He has also coached and led the Finnish team at several international programming contests, including the International Olympiad in Informatics 2009-2016, and has established experience in teaching programming and algorithms.¿
Provides a comprehensive introduction to algorithmic problem solving in the context of programming contests
Describes numerous "folklore" algorithm design tricks used by experienced competitive programmers
Presents an accessible style designed to aid the reader in developing an intuitive understanding of why algorithms work and how to design them
Expanded second edition, featuring new material on code optimization, the discrete Fourier transform, minimum-cost flows, automata theory, and heuristic search algorithms
Introduction.- Programming Techniques.- Efficiency.- Sorting and Searching.- Data Structures.- Dynamic Programming.- Graph Algorithms.- Algorithm Design Topics.- Range Queries.- Tree Algorithms.- Mathematics.- Advanced Graph Algorithms.- Geometry.- String Algorithms.- Additional Topics.- Appendix A: Mathematical Background.
Erscheinungsjahr: | 2020 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Seiten: | 328 |
Reihe: | Undergraduate Topics in Computer Science |
Inhalt: |
XV
309 S. 222 s/w Illustr. 65 farbige Illustr. 309 p. 287 illus. 65 illus. in color. |
ISBN-13: | 9783030393564 |
ISBN-10: | 3030393569 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Autor: | Laaksonen, Antti |
Auflage: | 2nd ed. 2020 |
Hersteller: |
Springer International Publishing
Undergraduate Topics in Computer Science |
Maße: | 235 x 155 x 18 mm |
Von/Mit: | Antti Laaksonen |
Erscheinungsdatum: | 09.05.2020 |
Gewicht: | 0,499 kg |
Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland. He has served as one of the organizers of the Finnish Olympiad in Informatics since 2008, and as the Scientific Chair of the Baltic Olympiad in Informatics in 2016. He has also coached and led the Finnish team at several international programming contests, including the International Olympiad in Informatics 2009-2016, and has established experience in teaching programming and algorithms.¿
Provides a comprehensive introduction to algorithmic problem solving in the context of programming contests
Describes numerous "folklore" algorithm design tricks used by experienced competitive programmers
Presents an accessible style designed to aid the reader in developing an intuitive understanding of why algorithms work and how to design them
Expanded second edition, featuring new material on code optimization, the discrete Fourier transform, minimum-cost flows, automata theory, and heuristic search algorithms
Introduction.- Programming Techniques.- Efficiency.- Sorting and Searching.- Data Structures.- Dynamic Programming.- Graph Algorithms.- Algorithm Design Topics.- Range Queries.- Tree Algorithms.- Mathematics.- Advanced Graph Algorithms.- Geometry.- String Algorithms.- Additional Topics.- Appendix A: Mathematical Background.
Erscheinungsjahr: | 2020 |
---|---|
Genre: | Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Seiten: | 328 |
Reihe: | Undergraduate Topics in Computer Science |
Inhalt: |
XV
309 S. 222 s/w Illustr. 65 farbige Illustr. 309 p. 287 illus. 65 illus. in color. |
ISBN-13: | 9783030393564 |
ISBN-10: | 3030393569 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Autor: | Laaksonen, Antti |
Auflage: | 2nd ed. 2020 |
Hersteller: |
Springer International Publishing
Undergraduate Topics in Computer Science |
Maße: | 235 x 155 x 18 mm |
Von/Mit: | Antti Laaksonen |
Erscheinungsdatum: | 09.05.2020 |
Gewicht: | 0,499 kg |