Algorithmic Thinking Problem-Based Introduction by Daniel Zingaro 2020 Trade Paperback-image
Algorithmic Thinking Problem-Based Introduction by Daniel Zingaro 2020 Trade Paperback-image

Algorithmic Thinking Problem-Based Introduction by Daniel Zingaro 2020 Trade Paperback

$ 5.95

Format: Trade Paperback Language: English gtin13: 9781718500808 LC Classification Number: QA76.9.A43Z56 2020 Item Length: 9.2 in Publisher: No Starch Press, Incorporated Synopsis: Readers tackle challenging topics like recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data. The book contains no pseudocode: all code is written in C and is thoroughly explained in the text (C is a de facto programming language for programming competitions). Zingaro also shows how several problems can be reduced to algorithms on graphs., A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer., A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer. Algorithmic Thinking will teach you how to solve challenging programming problems and design your own algorithms. Daniel Zingaro, a master teacher, draws his examples from world-class programming competitions like USACO and IOI. You'll learn how to classify problems, choose data structures, and identify appropriate algorithms. You'll also learn how your choice of data structure, whether a hash table, heap, or tree, can affect runtime and speed up your algorithms; and how to adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems. Line-by-line breakdowns of the code will teach you how to use algorithms and data structures like: - The breadth-first search algorithm to find the optimal way to play a board game or find the best way to translate a book - Dijkstra's algorithm to determine how many mice can exit a maze or the number of fastest routes between two locations - The union-find data structure to answer questions about connections in a social network or determine who are friends or enemies - The heap data structure to determine the amount of money given away in a promotion - The hash-table data structure to determine whether snowflakes are unique or identify compound words in a dictionary NOTE: Each problem in this book is available on a programming-judge website. You'll find the site's URL and problem ID in the description. What's better than a free correctness check? ISBN-13: 9781718500808 Type: Textbook LCCN: 2020-031510 Number of Pages: 408 Pages Item Weight: 27.2 Oz Author: Daniel Zingaro Publication Year: 2020 Reviews: "A good choice for anyone who needs to understand and implement algorithms." --RedGreenCode "With Zingaro as a tutor by your side, you'll learn, through practice on challenging competition problems, a repeatable process for figuring out and deftly applying the most appropriate algorithmic tools for the job. You'll learn it all from a book that exudes clarity, humor, and just the right dose of Canadian pride. Happy problem-solving!" -- Dr. Tim Roughgarden, Professor of Computer Science at Columbia University Dewey Decimal: 005.13 Subject: Programming / Algorithms, Programming / Open Source, General, Programming Languages / C ISBN-10: 1718500807 Item Width: 7 in Item Height: 1 in Subject Area: Mathematics, Computers brand: No Starch Press, Incorporated Intended Audience: Trade Publication Name: Algorithmic Thinking : a Problem-Based Introduction Illustrated: Yes Dewey Edition: 23 Table Of Content: Foreword Introduction Chapter 1: Hash Tables Chapter 2: Trees and Recursion Chapter 3: Memoization and Dynamic Programming Chapter 4: Graphs and Breadth-First Search Chapter 5: Shortest Paths in Weighted Graphs Chapter 6: Binary Search Chapter 7: Heaps and Segment Trees Chapter 8: Union-Find Chapter 9: Afterword Appendix A: Algorithm Runtime Appendix B: Because I Can't Resist Appendix C: Problem Credits Index

Description

payment | shipping rates | returns Algorithmic Thinking: A Problem-Based Introduction Product Category : Books ISBN : 9781718500808 Title : Algorithmic Thinking: A Problem-Based Introduction EAN : 9781718500808 Authors : Zingaro, Daniel Binding : Paperback Publisher : No Starch Press Publication Date : 2020-12-15 Pages : 408 Signed : False First Edition : False Dust Jacket : False List Price (MSRP) : 49.95 Height : 1.0600 inches Width : 6.9700 inches Length : 9.2100 inches Weight : 1.6998 pounds Condition : Good About hpb-red Selling quality books and media since 1972. Customer service is our top priority! Payment We accept several payment types. They are shown above. Shipping Please click the "Shipping and Payments" tab above for details. Returns Your satisfaction is very important to us. Please contact us via the methods available within eBay regarding any problems before leaving negative feedback. You have 60 days from purchase to request a refund. © 2025 hpb-red

  1. This book is a game-changer for anyone diving into algorithms! The problem-based approach makes complex concepts easy to grasp, and the real-world examples keep it engaging. Perfect for beginners and intermediate learners alike—clear explanations and practical exercises solidify understanding. A must-have for coding interviews or CS students! The paperback is sturdy, and the layout is clean. Worth every penny for the knowledge packed inside. Highly recommend!

    Sam.X.4ac220

Related products