Picture 1 of 3



Gallery
Picture 1 of 3



Have one to sell?
Algorithmic Thinking 2nd Edition: Unlock Your Programming Potential (D. Zingaro)
C $49.99
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages. See the seller’s listing for full details.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Located in: Mississauga, Ontario, Canada
Delivery:
Varies
Returns:
No returns accepted.
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:305413897113
Item specifics
- Condition
- Publication Year
- 2024
- Type
- Textbook
- Format
- Paperback
- Subject Area
- Algorithms
- Publication Name
- Algorithmic Thinking, 2nd Edition
- Subject
- Computer Science
- ISBN
- 9781718503229
About this product
Product Identifiers
Publisher
No Starch Press, Incorporated
ISBN-10
1718503229
ISBN-13
9781718503229
eBay Product ID (ePID)
4060721842
Product Key Features
Number of Pages
480 Pages
Language
English
Publication Name
Algorithmic Thinking, 2nd Edition : Learn Algorithms to Level Up Your Coding Skills
Publication Year
2024
Subject
Programming / Algorithms, Programming / Open Source, General, Programming Languages / C
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
1.1 in
Item Weight
32.2 Oz
Item Length
9.2 in
Item Width
7.1 in
Additional Product Features
Intended Audience
Trade
Reviews
"Algorithmic Thinking provides the theoretical background and detailed problem explanations required to stay ahead of our human and robotic competitors." --Duncan Smith, Senior Software Engineer at Microsoft "In this newly revised edition, Daniel presents a carefully curated collection of challenging programming problems. By deconstructing the problems alongside clear, practical presentations of algorithms and data structures, Algorithmic Thinking will empower you-whether you're looking to get a leg up on technical interviews, enter the world of competitive programming, or just want to sharpen your skills." --Josh Lospinoso, Ph.D., author of C++ Crash Course "As someone who learnt algorithms from similar problems-oriented books in the early 00s, I believe an updated yet beginner-friendly exposition is long overdue. This book provides implementation-friendly introductions to most building blocks of combinatorial algorithms . . . It's by far the quickest way to get hands-on experience with algorithms, and is also a great supplement to more theoretical expositions." --Richard Peng, Associate Professor at the University of Waterloo's Cheriton School of Computer Science "Not only does Algorithmic Thinking guide readers on how to approach tackling problems, but Zingaro also helps them understand why these approaches work. With an engaging selection of problems drawn from programming competitions, the book is an excellent guide and an engaging companion for the readers on their learning journey." --Sushant Sachdeva, Ph.D., Algorithms Professor at the University of Toronto "The step-by-step solution explanations are so detailed that it feels like Daniel is directly teaching us, his readers. This Second Edition is a worthy update to an already excellent text. I particularly like the new chapter on the rarely discussed randomized algorithms. I believe Computer Science students will enjoy reading it as I do." --Dr Steven Halim, Senior Lecturer at National University of Singapore "The book discusses many interesting problems from programming contests and presents useful techniques that are not often included in algorithm textbooks." --Antti Laaksonen, University of Helsinki
Dewey Edition
23
Dewey Decimal
005.1
Table Of Content
Foreword Introduction Acknowledgments Chapter 1: Hash Tables Chapter 2: Trees and Recursion Chapter 3: Memoization and Dynamic Programming Chapter 4: Advanced Memoization and Dynamic Programming Chapter 5: Graphs and Breadth-First Search Chapter 6: Shortest Paths in Weighted Graphs Chapter 7: Binary Search Chapter 8: Heaps and Segment Trees Chapter 9: Union-Find Chapter 10: Randomization Afterword Appendix A: Algorithm Runtime Appendix B: Because I Can't Resist Appendix C: Problem Credits Index
Synopsis
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., 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.
LC Classification Number
QA76.9.A43Z5 2024
Item description from the seller
Seller Feedback
No feedback yet
More to explore:
- Yours Magazines,
- Choose Your Own Adventure,
- Fiction & Think and Grow Rich Nonfiction Books,
- Think and Grow Rich Hardcover Nonfiction Books & Magazines,
- Fyi for Your Improvement Books,
- Choose Your Own Adventure Action Fiction Fiction & Nonfiction Books,
- Collector's Edition Magazines,
- Collector's Edition People Magazines,
- 1st Edition Magazines,
- Teacher's Edition Textbooks