Guide to Competitive Programming: Learning and Improving Algorithms Through Contests - Undergraduate Topics in Computer Science (Paperback)
  • Guide to Competitive Programming: Learning and Improving Algorithms Through Contests - Undergraduate Topics in Computer Science (Paperback)
zoom

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests - Undergraduate Topics in Computer Science (Paperback)

(author)
£26.99
Paperback 283 Pages / Published: 22/01/2018
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

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.

Publisher: Springer International Publishing AG
ISBN: 9783319725468
Number of pages: 283
Weight: 615 g
Dimensions: 235 x 155 mm
Edition: 1st ed. 2017

You may also be interested in...

Python Crash Course
Added to basket
£33.99
Paperback
Python for Data Science For Dummies
Added to basket
Introduction to Algorithms
Added to basket
Python in Easy Steps
Added to basket
The Bride of Science
Added to basket
Code
Added to basket
£21.99
Paperback
C++ Pocket Reference
Added to basket
How to Build a Billion Dollar App
Added to basket
Automate The Boring Stuff With Python
Added to basket
Python Pocket Reference
Added to basket
Clean Code
Added to basket
£36.99
Paperback
C Programming in Easy Steps
Added to basket
Learning Python
Added to basket
£51.99
Paperback
Coding for Beginners in easy steps
Added to basket
JavaScript Pocket Reference
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.