Carte Think in Recursion in Algorithmic Programming Jin Fang

Think in Recursion in Algorithmic Programming

Autor: Jin Fang
Limbă: engleză
Legare: Carte broșată
Editura: BPB Publications
Disponibilitate: În depozitul extern
Expediem în 9-15 zile
183.57 lei
DESCRIPTION Recursion, a fundamental programming concept, empowers developers to solve complex probl...

Informații despre carte

Autor
Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2024
Pagini
300
EAN
9789365891348
ISBN
9365891345
Enbook ID
46453160
Greutate
564
Dimensiuni
191 x 235 x 16

Descriere completă

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. 

S-ar putea să te intereseze

Lex

Cora Rose
69.41 lei
191.73 lei

Rodeo Red

Molly Idle
47.24 lei

Adorning Fashion

Deanna Farneti Cera
331.48 lei
551.23 lei
1 100.75 lei

Johann Strauss and Vienna

Camille Crittenden
782.16 lei

Great Bird Flu Hoax

Joseph Mercola
69.81 lei

Clienții care au cumpărat această carte au mai cumpărat și

Benim Hikayem

Arman Cakilciyan
86.24 lei
58.33 lei
359.59 lei

MANUAL DE PLANIFICACION DE MEDIOS

M.ANGELES GONZALEZ LOBO
216.92 lei

Estudio Antropomorfico

Luis Villalobos
139.74 lei
12.58 lei
51.37 lei

Folwark zwierzęcy

Orwell George
35.46 lei