你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada Guide to Competitive Programming: Learning and Improving Algorithms Through Contests
Type
Physical Book
Publisher
Language
English
Pages
380
Format
Paperback
Dimensions
23.5 x 15.5 x 0.0 cm
ISBN13
9783031617935
Edition No.
0003

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests

Antti Laaksonen (Author) · Springer · Paperback

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests - Laaksonen, Antti

Cheaper New Book Imported to Taiwan
Delivery: 22 Sep - 05 Oct Shipping: 16 to 20 business days.
NT$ 1,896
Faster New Book Imported to Taiwan
Delivery: 16 Sep - 25 Sep Shipping: 12 to 14 business days.
NT$ 1,989
NT$ 1,896

Synopsis "Guide to Competitive Programming: Learning and Improving Algorithms Through Contests"

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

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews