Книга Think in Recursion in Algorithmic Programming Jin Fang

Think in Recursion in Algorithmic Programming

Автор: Jin Fang
Език: Английски език
Корици: С меки корици
Издател: BPB Publications
Наличност: Външен склад
Изпращаме след 9-15 дни
33.42 65.35 лв
DESCRIPTION Recursion, a fundamental programming concept, empowers developers to solve complex probl...

Информация за книгата

Автор
Език
Английски език
Корици
Книга - С меки корици
Издадена
2024
страници
300
EAN
9789365891348
ISBN
9365891345
Enbook ID
46453160
Издател
Теглоt
564
Размери
191 x 235 x 16

Пълно описание

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 FOR

The 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. 

Може също да ви хареса

Lex

Cora Rose
12.49 24.43 лв
67.19 131.41 лв
36.63 71.64 лв

Rodeo Red

Molly Idle
9.03 17.66 лв

Adorning Fashion

Deanna Farneti Cera
67.19 131.41 лв
105.32 205.99 лв
165.59 323.86 лв
210.35 411.41 лв
82.04 160.45 лв

Johann Strauss and Vienna

Camille Crittenden
142.86 279.41 лв

Great Bird Flu Hoax

Joseph Mercola
14.10 27.57 лв

Клиенти, които купиха тази книга, купиха също

Benim Hikayem

Arman Cakilciyan
16.45 32.18 лв
11.69 22.86 лв
72.30 141.42 лв
28.55 55.83 лв

MANUAL DE PLANIFICACION DE MEDIOS

M.ANGELES GONZALEZ LOBO
43.50 85.08 лв

Estudio Antropomorfico

Luis Villalobos
26.69 52.20 лв
2.50 4.90 лв
9.33 18.25 лв
7.67 15.01 лв

Folwark zwierzęcy

Orwell George
7.12 13.93 лв