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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Dr. Daniel Zingaro is an award-winning associate professor of mathematical and computational sciences at the University of Toronto Mississauga. He is well known for his uniquely interactive approach to teaching and internationally recognized for his expertise in active learning. He is also the author of Learn to Code by Solving Problems (No Starch Press) and co-author of Learn AI-Assisted Python Programming.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 17,17 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoEUR 4,60 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: DB-9781718503229
Cantidad disponible: 6 disponibles
Librería: Rarewaves USA, OSWEGO, IL, Estados Unidos de America
Paperback. Condición: New. Computer Programming. Knowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms-minus the proofs and complex math. Forget the useless pseudocode and played-out examples you've seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you'll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across. The second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language. Learn how to: Classify problems, choose data structures, and identify appropriate algorithms; Choose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed; Adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems; Apply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra's algorithm to determine the fastest routes between two locations, and many more. Nº de ref. del artículo: LU-9781718503229
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 45751773-n
Cantidad disponible: 15 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 45751773
Cantidad disponible: 15 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. New copy - Usually dispatched within 4 working days. 526. Nº de ref. del artículo: B9781718503229
Cantidad disponible: 3 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. 2nd edition NO-PA16APR2015-KAP. Nº de ref. del artículo: 26396214878
Cantidad disponible: 3 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. 2024. 2nd Edition. paperback. . . . . . Nº de ref. del artículo: V9781718503229
Cantidad disponible: 15 disponibles
Librería: Rarewaves.com UK, London, Reino Unido
Paperback. Condición: New. Computer Programming. Knowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms-minus the proofs and complex math. Forget the useless pseudocode and played-out examples you've seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you'll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across. The second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language. Learn how to: Classify problems, choose data structures, and identify appropriate algorithms; Choose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed; Adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems; Apply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra's algorithm to determine the fastest routes between two locations, and many more. Nº de ref. del artículo: LU-9781718503229
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves USA United, OSWEGO, IL, Estados Unidos de America
Paperback. Condición: New. Computer Programming. Knowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms-minus the proofs and complex math. Forget the useless pseudocode and played-out examples you've seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you'll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across. The second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language. Learn how to: Classify problems, choose data structures, and identify appropriate algorithms; Choose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed; Adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems; Apply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra's algorithm to determine the fastest routes between two locations, and many more. Nº de ref. del artículo: LU-9781718503229
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781718503229_new
Cantidad disponible: 7 disponibles