國立虎尾科技大學 |

Guide to Competitive Programming = Learning and Improving Algorithms Through Contests /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Guide to Competitive Programming/ by Antti Laaksonen.
Reminder of title:	Learning and Improving Algorithms Through Contests /
Author:	Laaksonen, Antti.
Description:	XV, 309 p. 287 illus., 65 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer programming. -
Online resource:	https://doi.org/10.1007/978-3-030-39357-1
ISBN:	9783030393571

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. - 2nd ed. 2020. - XV, 309 p. 287 illus., 65 illus. in color.online resource. - 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

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

527822
Computer programming.

LC Class. No.: QA76.6-76.66

Dewey Class. No.: 005.11

Guide to Competitive Programming = Learning and Improving Algorithms Through Contests /
LDR:03768nam a22003975i 4500 001 1025796
003 DE-He213
005 20201102203732.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030393571 $9 978-3-030-39357-1
024 7 $a 10.1007/978-3-030-39357-1 $2 doi
035 $a 978-3-030-39357-1
050 4 $a QA76.6-76.66
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
082 0 4 $a 005.11 $2 23
100 1 $a Laaksonen, Antti. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $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 2nd ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XV, 309 p. 287 illus., 65 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 527822
650 0 $a Algorithms. $3 527865
650 0 $a Computer software. $3 528062
650 0 $a Education—Data processing. $3 1253610
650 1 4 $a Programming Techniques. $3 669781
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Professional Computing. $3 1115983
650 2 4 $a Computers and Education. $3 669806
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030393564
776 0 8 $i Printed edition: $z 9783030393588
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-030-39357-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)