Guide to Competitive Programming Guide to Competitive Programming

Guide to Competitive Programming

Learning and Improving Algorithms Through Contests

    • $34.99
    • $34.99

Publisher Description

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 Fourier transforms, finding minimum cost flows in graphs, and using automata in string 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 thinking and improving both programming and debugging skills.

Topics and features:
Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingReviewsthe features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data setsDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes 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.

GENRE
Computers & Internet
RELEASED
2020
May 8
LANGUAGE
EN
English
LENGTH
324
Pages
PUBLISHER
Springer International Publishing
SELLER
Springer Nature B.V.
SIZE
11.7
MB

More Books Like This

DAA Tutorial DAA Tutorial
2021
Computer Algorithms Using C Computer Algorithms Using C
2014
How to Think About Algorithms How to Think About Algorithms
2008
Discrete Mathematics for Computer Science Discrete Mathematics for Computer Science
2020
First Course in Algorithms Through Puzzles First Course in Algorithms Through Puzzles
2018
Basic Concepts in Data Structures Basic Concepts in Data Structures
2016

More Books by Antti Laaksonen