000 04412nam a22005535i 4500
001 978-3-031-61794-2
003 DE-He213
005 20251030112841.0
007 cr nn 008mamaa
008 240807s2024 sz | s |||| 0|eng d
020 _a9783031617942
_9978-3-031-61794-2
024 7 _a10.1007/978-3-031-61794-2
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
100 1 _aLaaksonen, Antti.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982008
245 1 0 _aGuide to Competitive Programming
_h[electronic resource] :
_bLearning and Improving Algorithms Through Contests /
_cby Antti Laaksonen.
250 _a3rd ed. 2024.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2024.
300 _aXVIII, 349 p. 287 illus., 65 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,
_x2197-1781
505 0 _a1. Introduction -- 2. Programming Techniques -- 3. Efficiency -- 4. Sorting and Searching -- 5. Data Structures -- 6. Dynamic Programming -- 7. Graph Algorithms -- 8. Algorithm Design Topics -- 9. Range Queries -- 10. Tree Algorithms -- 11. Mathematics -- 12. Advanced Graph Algorithms -- 13. Geometry -- 14. String Algorithms -- 15. Additional Topics.
520 _aBuilding on what already is the most comprehensive introduction to competitive programming, this new edition now introduces Python’s use in the field and looks into how Generative A.I. (GenAI) will affect its future. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills. Topics and features: Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms Compatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structures Provides advice for students aiming for the IOI contest Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming Examines the use of the Python language in competitive programming Discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library Explores how GenAI will impact on the future of the field Covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries Describes a selection of more advanced topics, including square-root algorithms and dynamic programming optimization Fully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike. Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland.
650 0 _aComputer programming.
650 0 _aAlgorithms.
_958677
650 0 _aProgramming languages (Electronic computers).
_966206
650 0 _aEducation
_xData processing.
650 1 4 _aProgramming Techniques.
_965517
650 2 4 _aAlgorithms.
_958677
650 2 4 _aProgramming Language.
_966208
650 2 4 _aComputers and Education.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031617935
776 0 8 _iPrinted edition:
_z9783031617959
830 0 _aUndergraduate Topics in Computer Science,
_x2197-1781
_966494
856 4 0 _uhttps://doi.org/10.1007/978-3-031-61794-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
999 _c62290
_d62290