Peste 4 milioane de titluri în engleză și alte limbi! Descoperă-ți noua poveste astăzi!

Guide to Competitive Programming

Name: Guide to Competitive Programming
Brand: Springer Nature Switzerland AG
SKU: 9783030393564
Price: 212.94 RON
Availability: InStock

Learning and Improving Algorithms Through Contests

Autor: Antti Laaksonen

Limbă:

Legare: Carte broșată

Editura: Springer Nature Switzerland AG

Disponibilitate: În depozitul extern în cantități mici

Expediem în 11-15 zile

212.94 lei

This invaluable textbook presents a comprehensive introduction to modern competitive programming. Th...

Informații despre carte

Autor

Antti Laaksonen

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2020

Pagini

309

EAN

9783030393564

Enbook ID

25366163

Editura

Springer Nature Switzerland AG

Greutate

504

Dimensiuni

233 x 154 x 22

Descriere completă

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many "folklore" algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: 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; introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers.

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Guide to Competitive Programming

Learning and Improving Algorithms Through Contests

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și