Algorithmic Thinking: A Problem-Based Introduction

Zingaro, Daniel

ISBN 10: 1718500807 ISBN 13: 9781718500808

Editorial: No Starch Press, 2020

Idioma: Ingl�s

Condici�n: Nuevo Encuadernaci�n de tapa blanda

Guardar para m�s tarde

Vendido por Best_Seller, Edison, NJ, Estados Unidos de America

Vendedor de AbeBooks desde 20 de octubre de 2025

Calificaci�n del vendedor: 5 de 5 estrellas

Ver los art�culos de este vendedor

Ver todos los ejemplares de este libro

Nuevos - Encuadernaci�n de tapa blanda

Condici�n: Nuevo

Precio:

EUR 4,03

EUR 5,31 gastos de env�o en Estados Unidos de America

Cantidad disponible: 1 disponibles

A�adir al carrito

Guardar para m�s tarde

Descripci�n

Great Condition book about how to think algorithmicly.

N� de ref. del art�culo ABE-1761009434068

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo

Algorithmic Thinking: A Problem-Based Introduction

Editor

No Starch Press

Fecha de publicaci�n

2020

Idioma

Ingl�s

ISBN 10

1718500807

ISBN 13

9781718500808

Encuadernaci�n

Encuadernaci�n de tapa blanda

Estado

Nuevo

Estado de la sobrecubierta

Sin Sobrecubierta

Dimensiones

Peso

1 kilogramo

Cat�logos de vendedores

Acerca de

Sinopsis

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?

Acerca del autor

Dr. Daniel Zingaro is an award-winning Assistant Professor of Mathematical and Computational Sciences at the University of Toronto Mississauga, where he is well known for his uniquely interactive approach to teaching, and internationally recognized for his expertise in Active Learning.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Discover a welcoming, independent bookstore offering a wide selection of new and gently used books for readers of every age and interest. The store features neatly organized shelves by genre, making it easy to find everything from bestsellers and timeless classics to hidden gems and local favorites. Customers can browse in a cozy, inviting atmosphere, with friendly staff always ready to help and offer recommendations. Special features like staff picks, community events, and a curated collection of rare finds make this bookstore a hub for book lovers and a vibrant part of the local community. Great prices, thoughtful service, and a diverse selection ensure an enjoyable experience with every visit.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

Best_Seller
NJ, U.S.A.

Condiciones de venta y env�o

Condiciones de venta

Derecho a cancelaci�n

Selling to earn bread and butter.

Condiciones de env�o

Tarifas de env�o en Estados Unidos de America

Tarifas de env�o en Estados Unidos de America
Cantidad del pedido	De 5 a 10 d�as h�biles	De 3 a 7 d�as h�biles
Primer art�culo	EUR 5.31	EUR 10.59

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.