Name: Algorithmic Thinking: A Problem-Based Introduction (en Inglés)
Price: 174180.00 COP
Availability: InStock
Author: Zingaro, Daniel
ISBN: 9781718500808

portada Algorithmic Thinking: A Problem-Based Introduction (en Inglés)

Formato

Libro Físico

Autor

Daniel Zingaro

Editorial

No Starch Press

Idioma

Inglés

N° páginas

408

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 17.5 x 2.8 cm

Peso

0.76 kg.

ISBN13

9781718500808

Categorías

Algoritmos y estructuras de datos
Lenguajes de programación scripting

Algorithmic Thinking: A Problem-Based Introduction (en Inglés)

Daniel Zingaro (Autor) · No Starch Press · Tapa Blanda

Libro Nuevo

$ 174.180

$ 263.909

Ahorras: $ 89.729

34% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Jueves 30 de Mayo y el Lunes 10 de Junio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Algorithmic Thinking: A Problem-Based Introduction (en Inglés)"

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 bookDijkstra's algorithm to determine how many mice can exit a maze or the number of fastest routes between two locationsThe union-find data structure to answer questions about connections in a social network or determine who are friends or enemiesThe heap data structure to determine the amount of money given away in a promotionThe hash-table data structure to determine whether snowflakes are unique or identify compound words in a dictionaryNOTE: 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?