000 04486cam a22004935i 4500
001 21680931
003 OSt
005 20240701092718.0
006 m |o d |
007 cr |||||||||||
008 180102s2017 gw |||| o |||| 0|eng
010 _a 2019747191
020 _a9783030393564 (Pbk)
024 7 _a10.1007/978-3-319-72547-5
_2doi
035 _a(DE-He213)978-3-319-72547-5
040 _aDLC
_beng
_epn
_erda
_cIISERB
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2bicssc
072 7 _aUM
_2thema
082 0 4 _a005.11 L11G2
_223
100 1 _aLaaksonen, Antti.
_930628
245 1 0 _aGuide to Competitive Programming :
_bLearning and Improving Algorithms Through Contests
_cby Antti Laaksonen.
250 _a2nd ed.
260 _aSwitzarland:
_bSpringer-Nature,
_c2020.
300 _axv, 309 pages 266 illustrations, 96 illustrations in color.
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 _aAlgorithms.
_930629
650 0 _aComputer programming.
_930630
650 0 _aComputer software.
_930631
650 0 _aEducation-Data processing.
_930632
650 1 4 _aProgramming Techniques.
_930633
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_930634
650 2 4 _aAlgorithms.
_930629
650 2 4 _aComputers and Education.
_930635
650 2 4 _aProfessional Computing.
_930636
776 0 8 _iPrint version:
_tGuide to competitive programming.
_z9783319725468
_w(DLC) 2017960923
776 0 8 _iPrinted edition:
_z9783319725468
776 0 8 _iPrinted edition:
_z9783319725482
830 0 _aUndergraduate Topics in Computer Science,
_930637
906 _a0
_bibc
_corigres
_du
_encip
_f20
_gy-gencatlg
942 _2ddc
_cBK
999 _c10399
_d10399