Guide to Competitive Programming
Description
This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many "folklore" algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts.
Topics and features: 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; introduces the algorithm design technique of dynamic programming, and investigateselementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers.Reviews / Votes
"The chapters are more or less standalone. That makes this small volume a helpful reference for additional information or review of known algorithms and programming techniques. Given its practical intent, as well as the breadth of examples and references offered, this is a useful book for any practicing software engineer or developer. It would also be helpful as a supplementary text in an undergraduate programming or algorithms course." (Nathan Carlson, Computing Reviews, October, 2018)More details
Other editions
New editions
Additional editions
Person
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.
Content
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.
