Garantía de entrega
SKU/Artículo: AMZ-9365891345
Think in Recursion in Algorithmic Programming: Write recursive computer algorithms to solve complex problems (English Edition)
Format:
Paperback
Detalles del producto
Disponibilidad:
En stock
En stock
Peso con empaque:
0.71 kg
0.71 kg
Devolución:
Sí
Sí
Condición
Nuevo
Nuevo
Producto de:
Amazon
Amazon
Viaja desde
USA
USA
Sobre este producto
- DescriptionRecursion, a fundamental programming concept, empowers developers to solve complex problems elegantly and efficiently. However, excelling at recursion can be challenging due to its counterintuitive nature. This book is your comprehensive guide to understanding and applying recursion in your programming journey. This book is a complete guide to understanding recursion, starting from the basics and moving to more complex topics. It explains what recursion is and how it is different from iteration, using easy examples like calculating the factorial of a number, raising numbers to a power, and the Fibonacci sequence. The book then goes into more advanced topics like backtracking, dynamic programming, and tree traversal. It shows how to break big problems into smaller, manageable parts and how to make solutions faster with memoization. Real-world examples like the knapsack problem and finding the shortest path in a network are included. By the end of this book, readers will have a strong grasp of recursion, understanding not just how it works but also its practical applications. They will learn about Big O notation, which is crucial for evaluating the performance and efficiency of algorithms. Additionally, they will become familiar with function stacks, which play a vital role in understanding how recursive calls are managed in memory.Key Features● Master recursion fundamentals and apply them to real-world problems.● Explore advanced recursion techniques and optimization strategies.● Gain hands-on experience with practical recursion examples.What you will learn● Understand the basics of recursive algorithms and their nature.● Learn to plan, write, and stop recursion with boundary conditions.● Analyze recursive algorithm efficiency using Big O notation.● Differentiate between classical recursion and backtracking techniques.● Optimize recursion with memorization to improve performance.Who this book is forThe target audience for this book includes any programmer or engineer from diverse professional or academic backgrounds. This book can also be resourceful for anyone who wants to take programming industry job interviews, where often some basic recursive questions are asked to be solved quickly on site.Table of Contents1. Introduction2. What is Recursion?3. Recursion as the Architect4. Factorial and Power5. Fibonacci Sequence6. Climbing Stairs7. Edit Distance8. Paint Bucket9. Permutation10. Knapsack 0/111. Eight Queens12. Finding Path13. Tree Traversal14. Shortest Route
U$S 50,31
44% OFF
U$S 27,95
IMPORTÁ FACIL
Comprando este producto podrás descontar el IVA con tu número de RUT
NO CONSUME FRANQUICIA
Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.
U$S 50,31
44% OFF
U$S 27,95
¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!
Llega en 5 a 11 días hábiles
con envío
Tienes garantía de entrega
Compra protegida
Disfruta de una experiencia de compra segura y confiable
![]()
Garantía de entrega
Con Tiendamia todas tus compras cuentan con Garantía de Entrega o devolución total de tu dinero.
Compras 100% seguras y garantizadas, para que pidas lo que soñás y lo recibas del mundo a tu puerta.
Saber más.
Tarjetas prepagas, debito, y credito
Paga hasta en 12 cuotas sin interés con tarjetas de crédito.
Visa
Mastercard
American Express
Dinners
Discover
Lider
Midinero
OCA
OCA Blue
Tarjeta PREX
Pagos a través de PayPal
Paga en dólares con Tarjetas internacionales a través de PayPal.
PayPal
