國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Guide to competitive programminglear...

Laaksonen, Antti.

Guide to competitive programminglearning and improving algorithms through contests /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Guide to competitive programmingby Antti Laaksonen.
其他題名:	learning and improving algorithms through contests /
作者:	Laaksonen, Antti.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xv, 309 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer programming.
電子資源:	https://doi.org/10.1007/978-3-030-39357-1
ISBN:	9783030393571$q(electronic bk.)

Guide to competitive programminglearning and improving algorithms through contests /
Laaksonen, Antti.

Guide to competitive programminglearning and improving algorithms through contests /[electronic resource] :by Antti Laaksonen. - Second edition. - Cham :Springer International Publishing :2020. - xv, 309 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - Undergraduate topics in computer science..

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.

Building on what already is the most comprehensive introduction to competitive programming, this enhanced new textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. 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 Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming 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 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: 9783030393571$q(electronic bk.)

Standard No.: 10.1007/978-3-030-39357-1doiSubjects--Topical Terms:

181992
Computer programming.

LC Class. No.: QA76.6 / .L335 2020

Dewey Class. No.: 005.1

Guide to competitive programminglearning and improving algorithms through contests /
LDR:03402nmm a2200349 a 4500 001 579476
003 DE-He213
005 20200508145418.0
006 m
007 cr
008 201229s2020
020 $a 9783030393571$q(electronic bk.)
020 $a 9783030393564$q(paper)
024 7 $a 10.1007/978-3-030-39357-1 $2 doi
035 $a 978-3-030-39357-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6 $b .L335 2020
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 2020
100 1 $a Laaksonen, Antti. $3 798360
245 1 0 $a Guide to competitive programming $h [electronic resource] : $b learning and improving algorithms through contests / $c by Antti Laaksonen.
250 $a Second edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xv, 309 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
505 0 $a 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.
520 $a Building on what already is the most comprehensive introduction to competitive programming, this enhanced new textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. 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 Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming 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 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 181992
650 0 $a Computer programming $x Competitions. $3 798361
650 0 $a Algorithms. $3 184661
650 0 $a Education $x Data processing. $3 207353
650 1 4 $a Programming Techniques. $3 274470
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Professional Computing. $3 763344
650 2 4 $a Computers and Education. $3 274532
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Undergraduate topics in computer science. $3 559648
856 4 0 $u https://doi.org/10.1007/978-3-030-39357-1
950 $a Computer Science (Springer-11645)