Subtitled "Learning and Improving Algorithms Through Contests", this book looks at how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving programming and debugging skills. Author Dr. Antti Laaksonen introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms, as well as covering more advanced topics, such as maximum flows, Nim theory, and suffix structures. This new edition features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems.
<ASIN:3030393569>
Author: Dr. Antti Laaksonen Publisher: Springer Date:May 2020 Pages: 324 ISBN: 978-3030393564 Print: 3030393569 Kindle: B088CV4YLP Audience: computer science undergraduates or developers interested in competitive programming Level: Intermediate/Advanced Category: Theory

- 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++ programming language, 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
For more Book Watch just click.
Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed.
To have new titles included in Book Watch contact BookWatch@i-programmer.info
Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.
Python Machine Learning, 2nd Ed
Author: Sebastian Raschka and Vahid Mirjalili Publisher: Packt Pages: 622 ISBN: 978-1787125933 Print: 1787125939 Kindle: B0742K7HYF Audience: Python developers interested in machine learning Rating: 4.8 Reviewer: Mike James Python and machine learning are made for each other.
|
Making Simple Robots
Author: Kathy Cerceri Publisher: Maker Media ISBN: 9781457183638 Print: 1457183633 Kindle: B00U1VU2AQ Audience: 4 Rating: Young makers and their parents/teachers Reviewer: Harry Fairhead
The subtitle of this book is: Exploring Cutting-Edge Robotics with Everyday Stuff. How can " [ ... ]
| More Reviews |
|