Skip to content
Description
By: Daniel Zingaro
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?
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:
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?
You may also like
Top Trending
Dog Man 14: Dog Man: Big Jim Believes: A Graphic Novel (Dog Man #14)
Sale priceHK$85.00
Regular priceHK$150.00
In stock
Press Start! #17 The Super Jump Between Worlds! (Branches)
Sale priceHK$55.00
Regular priceHK$98.00
In stock
Darkstalker: A Graphic Novel (Wings of Fire: Legends Graphic Novel)
Sale priceHK$99.00
Regular priceHK$154.00
In stock
Warriors: A Starless Clan Box Set: Volumes 1 to 6
Sale priceHK$399.00
Regular priceHK$669.00
In stock
Harry Potter #4 and the Goblet of Fire (Interactive Illustrated Edition)
Sale priceHK$299.00
Regular priceHK$630.00
In stock