Skip to main content
  • Textbook
  • © 2020

Guide to Competitive Programming

Learning and Improving Algorithms Through Contests

Authors:

  • 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

Part of the book series: Undergraduate Topics in Computer Science (UTICS)

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-39357-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 54.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (16 chapters)

  1. Front Matter

    Pages i-xv
  2. Introduction

    • Antti Laaksonen
    Pages 1-7
  3. Programming Techniques

    • Antti Laaksonen
    Pages 9-25
  4. Efficiency

    • Antti Laaksonen
    Pages 27-41
  5. Sorting and Searching

    • Antti Laaksonen
    Pages 43-56
  6. Data Structures

    • Antti Laaksonen
    Pages 57-68
  7. Dynamic Programming

    • Antti Laaksonen
    Pages 69-82
  8. Graph Algorithms

    • Antti Laaksonen
    Pages 83-113
  9. Algorithm Design Topics

    • Antti Laaksonen
    Pages 115-125
  10. Range Queries

    • Antti Laaksonen
    Pages 127-137
  11. Tree Algorithms

    • Antti Laaksonen
    Pages 139-153
  12. Mathematics

    • Antti Laaksonen
    Pages 155-200
  13. Advanced Graph Algorithms

    • Antti Laaksonen
    Pages 201-227
  14. Geometry

    • Antti Laaksonen
    Pages 229-242
  15. String Algorithms

    • Antti Laaksonen
    Pages 243-261
  16. Additional Topics

    • Antti Laaksonen
    Pages 263-296
  17. Correction to: Range Queries

    • Antti Laaksonen
    Pages C1-C1Open Access
  18. Back Matter

    Pages 297-309

About this book

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 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

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.

Keywords

  • Programming
  • Algorithms
  • Contests
  • Software engineering
  • Problem solving
  • algorithm analysis and problem complexity

Authors and Affiliations

  • Department of Computer Science, University of Helsinki, Helsinki, Finland

    Antti Laaksonen

About the author

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.​

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-39357-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 54.99
Price excludes VAT (USA)