Algorithmic Thinking: A Problem-Based Introduction

Wizard's Widgets
(2042)
Vendedor particularRegistrado como vendedor particular
Por tanto, no se aplican las normas de protección de los consumidores derivadas de la legislación de la UE en materia de consumidores. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más información
USD9,99
Aproximadamente8,58 EUR
Estado:
En buen estado
Respira tranquilidad. Envíos y devoluciones gratis.
Envío:
Gratis USPS Media MailTM.
Ubicado en: Lynchburg, Virginia, Estados Unidos
Entrega:
Entrega prevista entre el mar. 9 dic. y el lun. 15 dic. a 94104
Calculamos el plazo de entrega con un método patentado que combina diversos factores, como la proximidad del comprador a la ubicación del artículo, el servicio de envío seleccionado, el historial de envíos del vendedor y otros datos. Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
30 días para devoluciones. El vendedor paga el envío de la devolución.
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:197917339938

Características del artículo

Estado
En buen estado: Libro que se ha leído pero que está en buen estado. Daños mínimos en la tapa, ...
Release Year
2020
Book Title
Algorithmic Thinking: A Problem-Based Introduction
ISBN
9781718500808
Categoría

Acerca de este producto

Product Identifiers

Publisher
No Starch Press, Incorporated
ISBN-10
1718500807
ISBN-13
9781718500808
eBay Product ID (ePID)
28038629043

Product Key Features

Number of Pages
408 Pages
Publication Name
Algorithmic Thinking : a Problem-Based Introduction
Language
English
Subject
Programming / Algorithms, Programming / Open Source, General, Programming Languages / C
Publication Year
2020
Type
Textbook
Subject Area
Mathematics, Computers
Author
Daniel Zingaro
Format
Trade Paperback

Dimensions

Item Height
1 in
Item Weight
27.2 Oz
Item Length
9.2 in
Item Width
7 in

Additional Product Features

Intended Audience
Trade
LCCN
2020-031510
Reviews
"A good choice for anyone who needs to understand and implement algorithms." --RedGreenCode "With Zingaro as a tutor by your side, you'll learn, through practice on challenging competition problems, a repeatable process for figuring out and deftly applying the most appropriate algorithmic tools for the job. You'll learn it all from a book that exudes clarity, humor, and just the right dose of Canadian pride. Happy problem-solving!" -- Dr. Tim Roughgarden, Professor of Computer Science at Columbia University
Dewey Edition
23
Illustrated
Yes
Dewey Decimal
005.13
Table Of Content
Foreword Introduction Chapter 1: Hash Tables Chapter 2: Trees and Recursion Chapter 3: Memoization and Dynamic Programming Chapter 4: Graphs and Breadth-First Search Chapter 5: Shortest Paths in Weighted Graphs Chapter 6: Binary Search Chapter 7: Heaps and Segment Trees Chapter 8: Union-Find Chapter 9: Afterword Appendix A: Algorithm Runtime Appendix B: Because I Can't Resist Appendix C: Problem Credits Index
Synopsis
Readers tackle challenging topics like recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data. The book contains no pseudocode: all code is written in C and is thoroughly explained in the text (C is a de facto programming language for programming competitions). Zingaro also shows how several problems can be reduced to algorithms on graphs., A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer., 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?
LC Classification Number
QA76.9.A43Z56 2020

Descripción del artículo del vendedor

Acerca de este vendedor

Wizard's Widgets

100% de votos positivos5,8 mil artículos vendidos

Se unió el abr 2020
Suele responder en 24 horas
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
We started selling on eBay in 2020 in the middle of the pandemic to help make ends meet, and have continued to expand our inventory with the goal of paying for our three kids to go to college. We sell ...
Ver más
Visitar tiendaContactar

Valoraciones detalladas sobre el vendedor

Promedio durante los últimos 12 meses
Descripción precisa
5.0
Gastos de envío razonables
4.9
Rapidez de envío
5.0
Comunicación
5.0

Votos de vendedor (2.039)

Todas las valoracionesselected
Positivas
Neutras
Negativas