1 option
Guide to Competitive Programming : Learning and Improving Algorithms Through Contests / by Antti Laaksonen.
- Format:
- Book
- Author/Creator:
- Laaksonen, Antti, author.
- Series:
- Computer Science (SpringerNature-11645)
- Undergraduate topics in computer science 1863-7310
- Undergraduate Topics in Computer Science, 1863-7310
- Language:
- English
- Subjects (All):
- Computer programming.
- Algorithms.
- Computer software.
- Education--Data processing.
- Education.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Professional Computing.
- Computers and Education.
- Local Subjects:
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Professional Computing.
- Algorithms.
- Computers and Education.
- Physical Description:
- 1 online resource (XV, 309 pages) : 291 illustrations, 65 illustrations in color.
- Edition:
- Second edition 2020.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-39357-1
- 9783030393571
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.