SKU/Artículo: AMZ-1686863268
An Illustrative Introduction to Algorithms
Format:
Paperback
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
0.62 kg
0.62 kg
Devolución:
Sí
Sí
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- This book was written to fill the gap that exists when Computer Science students, and programmers, attempt to learn and analyze the different algorithms that currently exist. I took a course on Algorithms and was disappointed in the type of material that’s currently available. There are two types of books that I kept running into: 1). First, the overly complex book. This book seems like it's designed for people that are already fluent in the topics and wanted a more detailed and mathematical approach to algorithms. 2). Second, the overly simple book. A basic introduction to algorithms. This is a high-level overview of some algorithms, and most complex algorithms are not mentioned. After completion, the person is still incapable of showing how the algorithm runs when a problem is presented. This book is designed for undergraduate upper-class students and programmers that want to expand their horizon. It can be used as a supplementary book alongside the complex book. Although no code is present, the reader will learn how the algorithm works to the point where they can solve it themselves. Readers will gain the knowledge necessary to solve those mathematically intensive algorithmic problems that were presented in the complex book. Each chapter consists of a brief description of how the algorithm works followed by a detailed example or two. No steps are skipped during the traversal process. The reader is presented with a clear, simplified approach to solving the algorithm that the chapter is dedicated to. Each chapter follows a natural progression from the previous chapter. If certain algorithms rely heavily on prior knowledge, the previous chapter covers that topic. For example, Kruskal’s algorithm relies heavily on prior knowledge of Minimum Spanning Trees and Greedy Algorithms. Each of those topics receives a chapter of its own. Thanks for supporting me while I continue to write. I do have the full version of this book available on my website for free if you choose to read it one article at a time: https://www.dinocajic.com/algorithms/
AR$174.192
55% OFF
AR$79.175
IMPORT EASILY
By purchasing this product you can deduct VAT with your RUT number
AR$174.192
55% OFF
AR$79.175
Pagá fácil y rápido con Mercado Pago o MODO
Llega en 8 a 12 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja
de USA ![]()
a tus manos en
![]()
a tus manos en
Compra protegida
Disfruta de una experiencia de compra segura y confiable
Tarjetas de Crédito y Débito
Visa
Mastercard
American Express
Pagos a través de PayPal
Compra procesada en dólares con dinero en cuenta o tarjetas internacionales.
Paypal
Pagos a través de MODO
Compra procesada en pesos desde la App de tu banco.
PayPal
