Think in Recursion in Algorithmic Programming - Jin, Fang
- Format: Broché Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtre49,10 €
Produit Neuf
Ou 12,28 € /mois
- Livraison à 0,01 €
- Livré entre le 16 et le 29 juillet
Brand new, In English, Fast shipping from London, UK; Tout neuf, en anglais, expédition rapide depuis Londres, Royaume-Uni;ria9789365891348_dbm
Nos autres offres
-
70,51 €
Produit Neuf
Ou 17,63 € /mois
- Livraison : 5,00 €
- Livré entre le 16 et le 21 juillet
Exp¿di¿ en 6 jours ouvr¿s
Voir le détail de l'annonce
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Think In Recursion In Algorithmic Programming de Jin, Fang Format Broché - Livre Informatique
0 avis sur Think In Recursion In Algorithmic Programming de Jin, Fang Format Broché - Livre Informatique
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Guide Officiel Bayonetta - Édition Collector
Occasion dès 40,00 €
-
St - Tropez Soleil
1 avis
Neuf dès 105,00 €
Occasion dès 72,53 €
-
L'intuition Intellectuelle De Kant A Hegel (Travaux Du Centre De Recherche Sur Le Droit Des Marches Et D)
Occasion dès 33,00 €
-
Collecting Antique Meerschaum Pipes
Neuf dès 55,84 €
-
A History Of Modern Europe
Neuf dès 66,61 €
-
Perfectionnement Allemand (5 Cd Audio)
1 avis
Occasion dès 47,90 €
-
The French Army And The First World War
Neuf dès 55,68 €
-
La Guerre Civile, 2 Tomes (Livres I-Iii)
Occasion dès 30,00 €
-
One Piece Magazine One Piece 020
Occasion dès 31,99 €
-
La Sante Interdite
1 avis
Occasion dès 71,00 €
-
Motel Fetish
1 avis
Occasion dès 59,00 €
-
Le Cul De La Femme - Une Collection De Portraits De Pierre Louÿs (1892-1914)
5 avis
Occasion dès 26,98 €
-
Technological Revolutions And Financial Capital : The Dynamics Of Bubbles And Golden Ages
Occasion dès 34,42 €
-
Delicious In Dungeon World Guide: The Adventurer's Bible, Complete Edition
Neuf dès 37,48 €
-
Dc Finest: War: The Big Five Arrive
1 avis
Neuf dès 39,95 €
-
Dc Finest: Legion Of Super-Heroes: Zap Goes The Legion
Neuf dès 39,64 €
-
Official Guide To Oet
Neuf dès 69,41 €
-
Dark City. The Real Los Angeles Noir
Neuf dès 50,00 €
Occasion dès 40,00 €
-
Le Guide Complet Du Seo: Donnez De La Visibilité À Votre Business En Ligne Grâce Au Seo ! (French Edition)
1 avis
Occasion dès 35,00 €
-
Agitator
Occasion dès 58,00 €
Produits similaires
Présentation Think In Recursion In Algorithmic Programming de Jin, Fang Format Broché
- Livre Informatique
Sommaire:
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. ...
Détails de conformité du produit
Personne responsable dans l'UE