Think in Recursion in Algorithmic Programming | Write recursive computer algorithms to solve complex problems (English Edition)

Fang Jin

ISBN 10: 9365891345 / ISBN 13: 9789365891348

Published by BPB Publications, 2024

About this Item

Think in Recursion in Algorithmic Programming | Write recursive computer algorithms to solve complex problems (English Edition) | Fang Jin | Taschenbuch | Englisch | 2024 | BPB Publications | EAN 9789365891348 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 129961126

Bibliographic Details

• Title: Think in Recursion in Algorithmic Programming | Write recursive computer algorithms to solve complex problems (English Edition)
• Publisher: BPB Publications
• Publication Date: 2024
• Language: English
• ISBN 10: 9365891345
• ISBN 13: 9789365891348
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 191H x 16D millimeters 235 millimeters width by 191 millimeters height by 16 millimeters depth
• Weight: 564 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.

Table of Contents

1. Introduction

2. What is Recursion?

3. Recursion as the Architect

4. Factorial and Power

5. Fibonacci Sequence

6. Climbing Stairs

7. Edit Distance

8. Paint Bucket

9. Permutation

10. Knapsack 0/1

11. Eight Queens

12. Finding Path

13. Tree Traversal

14. Shortest Route