Esta web utiliza cookies propias y de terceros que nos permiten optimizar tu experiencia en el sitio web, evaluar su rendimiento, generar estadísticas de uso y mejorar y añadir nuevas funcionalidades. Mediante el análisis de tus hábitos de navegación podemos mostrar contenidos más relevantes y medir las interacciones con la web.
Puede obtener más información aquí.

Avanzado
Artículos
Portada

THINK IN RECURSION IN ALGORITHMIC PROGRAMMING IBD

DR FANG JIN
BPB PUBLICATIONS
08 / 2024
9789365891348
Inglés

Sinopsis

DESCRIPTIONáRecursion, 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.á

PVP
43,68€