000 04956nam a22005175i 4500
001 978-3-319-72547-5
003 DE-He213
005 20200812105919.0
007 cr nn 008mamaa
008 180102s2017 gw | s |||| 0|eng d
020 _a9783319725475
_9978-3-319-72547-5
024 7 _a10.1007/978-3-319-72547-5
_2doi
040 _cCUS
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
100 1 _aLaaksonen, Antti.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aGuide to Competitive Programming
_h[electronic resource] :
_bLearning and Improving Algorithms Through Contests /
_cby Antti Laaksonen.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXII, 283 p. 266 illus., 96 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310
505 0 _aIntroduction -- 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.
520 _aThis 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.
650 0 _aComputer programming.
650 0 _aAlgorithms.
650 0 _aComputer software.
650 0 _aEducation—Data processing.
650 1 4 _aProgramming Techniques.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14010
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 2 4 _aProfessional Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I29000
650 2 4 _aAlgorithms.
_0https://scigraph.springernature.com/ontologies/product-market-codes/M14018
650 2 4 _aComputers and Education.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I24032
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
856 4 0 _uhttps://doi.org/10.1007/978-3-319-72547-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cEBK
999 _c205240
_d205240