Guide to Competitive Programming : Learning and Improving Algorithms Through Contests / by Antti Laaksonen.
2017
QA76.6-76.66
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Cite
Citation
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Guide to Competitive Programming : Learning and Improving Algorithms Through Contests / by Antti Laaksonen.
Author
ISBN
9783319725475
3319725475
9783319725468
3319725475
9783319725468
Published
Cham : Springer International Publishing : Imprint: Springer, 2017.
Language
English
Description
1 online resource (xii, 283 pages) : illustrations.
Item Number
10.1007/978-3-319-72547-5 doi
Call Number
QA76.6-76.66
Dewey Decimal Classification
005.1
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. 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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Series
Undergraduate topics in computer science.
Available in Other Form
Print version: 9783319725468
Linked Resources
Record Appears in
Table of 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.
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.