Picture 1 of 2
Gallery
Picture 1 of 2
Have one to sell?
Algorithmic Thinking: A Problem-Based Introduction
US $9.99
ApproximatelyRM 41.10
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: Lynchburg, Virginia, United States
Delivery:
Estimated between Tue, 9 Dec and Mon, 15 Dec to 94104
Returns:
30 days return. Seller pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
About this item
Seller assumes all responsibility for this listing.
eBay item number:197917339938
Item specifics
- Condition
- Release Year
- 2020
- Book Title
- Algorithmic Thinking: A Problem-Based Introduction
- ISBN
- 9781718500808
About this product
Product Identifiers
Publisher
No Starch Press, Incorporated
ISBN-10
1718500807
ISBN-13
9781718500808
eBay Product ID (ePID)
28038629043
Product Key Features
Number of Pages
408 Pages
Publication Name
Algorithmic Thinking : a Problem-Based Introduction
Language
English
Subject
Programming / Algorithms, Programming / Open Source, General, Programming Languages / C
Publication Year
2020
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
1 in
Item Weight
27.2 Oz
Item Length
9.2 in
Item Width
7 in
Additional Product Features
Intended Audience
Trade
LCCN
2020-031510
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 Edition
23
Illustrated
Yes
Dewey Decimal
005.13
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
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?
LC Classification Number
QA76.9.A43Z56 2020
Item description from the seller
Seller feedback (2,039)
- 6***j (2)- Feedback left by buyer.Past 6 monthsVerified purchaseI have nothing but good things to say about this purchase. I received the magazine within the predicted timeframe. The magazine was as described and was packaged very securely. The magazine arrived without damaged. I would definitely order from them again! I appreciate the service. Oh, and the price of the magazine and shipping was extremely reasonable. I had seen the same magazine posted by another vender and it was almost twice the price. I think I got a great deal.
- 2***2 (19)- Feedback left by buyer.Past monthVerified purchaseSeller was quick to ship. The item was in great condition and as described. The price was a good value. They packaged it well. Would recommend them to others and buy from them again.
- 9***j (293)- Feedback left by buyer.Past monthVerified purchaseI have seen this statue in Golden Gate Park. As described and of great value. Superb Packaging, shipping, and speedy delivery.
More to explore :
Seller feedback (2,039)
- 6***j (2)- Feedback left by buyer.Past 6 monthsVerified purchaseI have nothing but good things to say about this purchase. I received the magazine within the predicted timeframe. The magazine was as described and was packaged very securely. The magazine arrived without damaged. I would definitely order from them again! I appreciate the service. Oh, and the price of the magazine and shipping was extremely reasonable. I had seen the same magazine posted by another vender and it was almost twice the price. I think I got a great deal.
- 2***2 (19)- Feedback left by buyer.Past monthVerified purchaseSeller was quick to ship. The item was in great condition and as described. The price was a good value. They packaged it well. Would recommend them to others and buy from them again.
- 9***j (293)- Feedback left by buyer.Past monthVerified purchaseI have seen this statue in Golden Gate Park. As described and of great value. Superb Packaging, shipping, and speedy delivery.