國立虎尾科技大學 |

Guide to competitive programming = learning and improving algorithms through contests /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Guide to competitive programming/ by Antti Laaksonen.
其他題名:	learning and improving algorithms through contests /
作者:	Laaksonen, Antti.
出版者:	Cham :Springer International Publishing : : 2024.,
面頁冊數:	xviii, 349 p. :ill., digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Computer programming. -
電子資源:	https://doi.org/10.1007/978-3-031-61794-2
ISBN:	9783031617942

Guide to competitive programming = learning and improving algorithms through contests /
Laaksonen, Antti.

Guide to competitive programminglearning and improving algorithms through contests /[electronic resource] :by Antti Laaksonen. - Third edition. - Cham :Springer International Publishing :2024. - xviii, 349 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,2197-1781. - Undergraduate topics in computer science..

1. 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.

Building 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.

ISBN: 9783031617942

Standard No.: 10.1007/978-3-031-61794-2doiSubjects--Topical Terms:

527822
Computer programming.

LC Class. No.: QA76.6 / .L225 2024

Dewey Class. No.: 005.1

Guide to competitive programming = learning and improving algorithms through contests /
LDR:03498nam a22003615a 4500 001 1134666
003 DE-He213
005 20240807130252.0
006 m d
007 cr nn 008maaau
008 241213s2024 sz s 0 eng d
020 $a 9783031617942 $q (electronic bk.)
020 $a 9783031617935 $q (paper)
024 7 $a 10.1007/978-3-031-61794-2 $2 doi
035 $a 978-3-031-61794-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6 $b .L225 2024
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.6 $b .L111 2024
100 1 $a Laaksonen, Antti. $3 1198216
245 1 0 $a Guide to competitive programming $h [electronic resource] : $b learning and improving algorithms through contests / $c by Antti Laaksonen.
250 $a Third edition.
260 $a Cham : $c 2024. $b Springer International Publishing : $b Imprint: Springer,
300 $a xviii, 349 p. : $b ill., digital ; $c 24 cm.
347 $a text file $b PDF $2 rda
490 1 $a Undergraduate topics in computer science, $x 2197-1781
505 0 $a 1. 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 $a Building 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 $a Computer programming. $3 527822
650 0 $a Computer programming $x Competitions. $3 1198217
650 0 $a Algorithms. $3 527865
650 0 $a Education $x Data processing. $3 599598
650 1 4 $a Programming Techniques. $3 669781
650 2 4 $a Programming Language. $3 1365750
650 2 4 $a Computers and Education. $3 669806
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Undergraduate topics in computer science. $3 791852
856 4 0 $u https://doi.org/10.1007/978-3-031-61794-2
950 $a Computer Science (SpringerNature-11645)