Könyv Think in Recursion in Algorithmic Programming Jin Fang

Think in Recursion in Algorithmic Programming

Szerző: Jin Fang
Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 9-15 napon belül
12 795 Ft
DESCRIPTION Recursion, a fundamental programming concept, empowers developers to solve complex probl...

Információk a könyvről

Szerző
Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2024
oldal
300
EAN
9789365891348
ISBN
9365891345
Enbook ID
46453160
Súly
564
Méretek
191 x 235 x 16

Teljes leírás

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. 

Érdekelheti

Lex

Cora Rose
4 869 Ft
13 432 Ft

Rodeo Red

Molly Idle
3 200 Ft

Adorning Fashion

Deanna Farneti Cera
23 853 Ft
38 537 Ft
76 962 Ft

Johann Strauss and Vienna

Camille Crittenden
54 464 Ft

Great Bird Flu Hoax

Joseph Mercola
5 008 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Benim Hikayem

Arman Cakilciyan
6 036 Ft
3 958 Ft
24 391 Ft

MANUAL DE PLANIFICACION DE MEDIOS

M.ANGELES GONZALEZ LOBO
14 716 Ft

Estudio Antropomorfico

Luis Villalobos
9 792 Ft
853 Ft
3 586 Ft

Folwark zwierzęcy

Orwell George
2 406 Ft