Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Think in Recursion in Algorithmic Programming
Write recursive computer algorithms to solve complex problems (English Edition)
Taschenbuch von Fang Jin
Sprache: Englisch

49,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
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.
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.
Details
Erscheinungsjahr: 2024
Fachbereich: EDV
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
ISBN-13: 9789365891348
ISBN-10: 9365891345
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Jin, Fang
Hersteller: BPB Publications
Verantwortliche Person für die EU: Produktsicherheitsverantwortliche/r, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 235 x 191 x 16 mm
Von/Mit: Fang Jin
Erscheinungsdatum: 17.08.2024
Gewicht: 0,564 kg
Artikel-ID: 129961126
Details
Erscheinungsjahr: 2024
Fachbereich: EDV
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
ISBN-13: 9789365891348
ISBN-10: 9365891345
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Jin, Fang
Hersteller: BPB Publications
Verantwortliche Person für die EU: Produktsicherheitsverantwortliche/r, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 235 x 191 x 16 mm
Von/Mit: Fang Jin
Erscheinungsdatum: 17.08.2024
Gewicht: 0,564 kg
Artikel-ID: 129961126
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte