Think Recursion Algorithmic Programming by Jin Fang (11 results)
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 28.07
£ 1.99 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
£ 30.12
Free ShippingShips within U.S.A.Quantity: 5 available
Paperback or Softback. Condition: New. Think in Recursion in Algorithmic Programming: Write recursive computer algorithms to solve complex problems (English Edition). Book.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 30.25
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 31.10
£ 1.99 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 36.79
Free ShippingShips within U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 33.17
£ 5.02 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 33.39
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 33.16
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 36.04
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 37.33
£ 59.98 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. 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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 44.58
£ 53.83 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - DESCRIPTIONRecursion, 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 co…mprehensive 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 FORThe 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.
