springer.com

Antti Laaksonen Guide to Learning and Improving Through Contests Series: Undergraduate Topics in

Provides a comprehensive introduction to algorithmic problem solving in the context of programming contests Describes numerous “folklore” 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 2nd ed. 2020, XV, 309 p. 287 illus., 65 illus. in color. Building on what already is the most comprehensive introduction to competitive programming, this enhanced new textbook features new material on advanced topics, such as calculating Printed book Fourier transforms, finding minimum cost flows in graphs, and using automata in string Softcover problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational 44,99 € | £39.99 | $54.99 thinking and improving both programminganddebugging skills. Topics and features: introduces [1]48,14 € (D) | 49,49 € (A) | CHF 53,50 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 eBook advanced topics, such as maximum flows, Nim theory, and suffix structures; surveys specialized 37,44 € | £31.99 | $39.99 algorithms for trees, and discusses the mathematical topics that are relevant in competitive [2] 37,44 € (D) | 37,44 € (A) | CHF programming; reviews the features of the C++ , and describes how to 42,50 create efficient algorithms that can quickly process large data sets; discusses sorting Available from your library or algorithms and binary search, and examines a selection of data structures of the C++ standard springer.com/shop library; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, MyCopy [3] and presents a focus on efficiently processing array range queries; describes a selection of Printed eBook for just more advanced topics, including square-root algorithms and dynamic programming optimization. € | $ 24.99 springer.com/mycopy

Order online at springer.com / or for the Americas call (toll free) 1-800-SPRINGER / or email us at: [email protected]. / For outside the Americas call +49 (0) 6221-345-4301 / or email us at: [email protected]. The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with [1] include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with [2] include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. [3] No discount for MyCopy.

Part of