Algorithmic Thinking, 2nd Edition (Paperback)
Daniel Zingaro
Sold by AussieBookSeller, Truganina, VIC, Australia
AbeBooks Seller since June 22, 2007
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by AussieBookSeller, Truganina, VIC, Australia
AbeBooks Seller since June 22, 2007
Condition: New
Quantity: 1 available
Add to basketPaperback. Get in the game and learn essential computer algorithms by solving competitive programming problems, in the fully revised second edition of the bestselling original. (Still no math required!)Get in the game and learn essential computer algorithms by solving competitive programming problems, in the fully revised second edition of the bestselling original. (Still no math required!)Are you hitting a wall with data structures and algorithms? Whether you're a student prepping for coding interviews or an independent learner, this book is your essential guide to efficient problem-solving in programming.UNLOCK THE POWER OF DATA STRUCTURES & ALGORITHMS-Learn the intricacies of hash tables, recursion, dynamic programming, trees, graphs, and heaps. Become proficient in choosing and implementing the best solutions for any coding challenge.REAL-WORLD, COMPETITION-PROVEN CODE EXAMPLES-The programs and challenges in this book aren't just theoretical-they're drawn from real programming competitions. Train with problems that have tested and honed the skills of coders around the world.GET INTERVIEW-READY-Prepare yourself for coding interviews with practice exercises that help you think algorithmically, weigh different solutions, and implement the best choices efficiently.WRITTEN IN C, USEFUL ACROSS LANGUAGES-The code examples are written in C and designed for clarity and accessibility to those familiar with languages like C++, Java, or Python. If you need help with the C code, no problem- We've got recommended reading, too.Algorithmic Thinking is the complete package, providing the solid foundation you need to elevate your coding skills to the next level. "An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"-- Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Seller Inventory # 9781718503229
"About this title" may belong to another edition of this title.
We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.
Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.
Order quantity | 25 to 45 business days | 8 to 14 business days |
---|---|---|
First item | US$ 37.00 | US$ 44.00 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.