Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item for full refund. Ships via media mail.
Zustand: New.
Sprache: Englisch
Verlag: Bpb Publications 8/17/2024, 2024
ISBN 10: 9365891345 ISBN 13: 9789365891348
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. Think in Recursion in Algorithmic Programming: Write recursive computer algorithms to solve complex problems (English Edition). Book.
Zustand: New.
Zustand: As New. Unread book in perfect condition.
Paperback. Zustand: New.
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 39,30
Anzahl: 1 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 51,38
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 38,33
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 39,29
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 42,56
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
EUR 45,61
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 48,07
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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.
Taschenbuch. Zustand: 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 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 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.