Stock photo: cover may vary
Guide To Competitive Programming (Undergraduate Topics in Computer Science) Papeback -
by Antti Laaksonen
- New
A$71.19
A$5.66
Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Standard delivery: 9 to 14 days
Ships from Cold Books (New York, United States)
Details
- Title Guide To Competitive Programming (Undergraduate Topics in Computer Science)
- Author Antti Laaksonen
- Binding Papeback
- Condition New
- Pages 309
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date pp. 320
- Illustrated Yes
- Bookseller's Inventory # 6377384467
- ISBN 9783030393564 / 3030393569
- Weight 1.01 lbs (0.46 kg)
- Dimensions 9.25 x 6.1 x 0.69 in (23.50 x 15.49 x 1.75 cm)
- Category Computers - Languages / Programming
- Quantity available 4
About Cold Books New York, United States
Reader reviews for Guide To Competitive Programming (Undergraduate Topics in Computer Science)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
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
- Reviewsthe 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.
