Limit search to available items
Record 7 of 11
Previous Record Next Record
Book Cover
Author Laaksonen, Antti, author.

Title Guide to competitive programming : learning and improving algorithms through contests / Antti Laaksonen
Published Cham, Switzerland : Springer, [2018]



Description 1 online resource (xii, 283 pages)
Series Undergraduate Topics in Computer Science, 1863-7310
Undergraduate topics in computer science, 1863-7310
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
Summary 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 investigates elementary 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
Bibliography Includes bibliographical references and index
Notes Description based on print version record
Subject Algorithms.
Computer programming -- Competitions
Computer programming.
Education -- Data processing.
Algorithms & data structures.
Computer programming / software development.
Computer programming -- Competitions.
Computer programming.
Computers -- General.
Computers -- Programming -- Algorithms.
Computers -- Programming -- General.
Computing & information technology.
Education -- Computers & Technology.
Education -- Data processing.
Educational equipment & technology, computer-aided learning (CAL).
Numerical analysis.
Form Electronic book
ISBN 3319725475