- Main
- Computers - Programming
- Algorithmic Thinking: A Problem-Based...
Algorithmic Thinking: A Problem-Based Introduction
Daniel ZingaroHow much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
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?
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?
Categories:
Year:
2020
Publisher:
No Starch Press, Inc.
Language:
english
ISBN 10:
1718500807
ISBN 13:
9781718500808
File:
EPUB, 22.03 MB
Your tags:
IPFS:
CID , CID Blake2b
english, 2020
The file will be sent to your email address. It may take up to 1-5 minutes before you receive it.
The file will be sent to you via the Telegram messenger. It may take up to 1-5 minutes before you receive it.
Note: Make sure you have linked your account to Z-Library Telegram bot.
The file will be sent to your Kindle account. It may take up to 1–5 minutes before you receive it.
Please note: you need to verify every book you want to send to your Kindle. Check your mailbox for the verification email from Amazon Kindle.
Conversion to is in progress
Conversion to is failed
Premium benefits
- Send to eReaders
- Increased download limit
- File converter
- More search results
- More benefits