Cantitate/Preț
Produs
Total produse
Vezi coșul
Introduction to Recursive Programming de Manuel Rubio-Sanchez

Introduction to Recursive Programming

Autor Manuel Rubio-Sanchez
en Limba Engleză Hardback – 21 sep 2017

În domeniul dezvoltării software și al algoritmicii, recursivitatea reprezintă o piatră de temelie, fiind totodată unul dintre conceptele care ridică cele mai mari dificultăți de înțelegere pentru programatorii la început de drum. Introduction to Recursive Programming de Manuel Rubio-Sanchez vine să umple un gol pedagogic, oferind un ghid tehnic riguros și aplicat. Observăm o abordare progresivă a materiei, care pornește de la fundamentele gândirii recursive și avansează spre structuri complexe, precum recursivitatea mutuală și problemele combinatorii.

Remarcăm organizarea logică a volumului, care dedică secțiuni specifice celor mai importante paradigme de design algoritmic: divide et impera și backtracking. Ca și ES Roberts în Thinking Recursively, autorul distilează experiența reală în principii acționabile, punând un accent deosebit pe 'cum' să gândești recursiv, nu doar pe sintaxă. Ceea ce diferențiază acest titlu de lucrări precum Quick Recursion de David Matuszek este profunzimea analizei matematice; Manuel Rubio-Sanchez nu se limitează la simplificarea conceptului, ci include capitole detaliate despre analiza runtime și costul computațional, oferind cititorului o înțelegere completă a performanței codului scris.

Structura cărții facilitează învățarea prin cele 168 de ilustrații care vizualizează procesele din spatele execuției programelor, transformând abstractul în concret. Utilizarea limbajului Python 3 asigură o barieră minimă de intrare, permițând concentrarea pe logică. De la fractali și puzzle-uri până la algoritmi de căutare și sortare, textul acoperă un spectru larg de aplicații practice, fiind un instrument de referință atât pentru studenți, cât și pentru profesioniștii care doresc să își rafineze abilitățile de optimizare a codului.

Citește tot Restrânge

Preț: 113204 lei

Preț vechi: 141505 lei
-20%

Puncte Express: 1698

Carte disponibilă

Livrare economică 20 mai-03 iunie
Livrare express 05-09 mai pentru 5007 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9781138105218
ISBN-10: 113810521X
Pagini: 450
Ilustrații: 168
Dimensiuni: 156 x 234 x 33 mm
Greutate: 1 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press

De ce să citești această carte

Recomandăm această carte programatorilor care doresc să stăpânească recursivitatea dincolo de definițiile teoretice. Cititorul câștigă o metodologie clară de rezolvare a problemelor complexe prin descompunere, susținută de diagrame vizuale și exerciții practice în Python. Este o resursă esențială pentru oricine pregătește interviuri tehnice de algoritmică sau lucrează la dezvoltarea de sisteme software ce necesită optimizarea structurilor de date arborescente.

Despre autor

Manuel Rubio-Sanchez este profesor și cercetător la Universidad Rey Juan Carlos din Spania, specializat în educația în domeniul informaticii. Expertiza sa se concentrează pe dezvoltarea de metodologii pedagogice care să faciliteze înțelegerea conceptelor abstracte de programare. Prin activitatea sa academică, acesta a contribuit la îmbunătățirea modului în care algoritmii și structurile de date sunt predate la nivel universitar, punând un accent deosebit pe vizualizare și aplicații practice, elemente centrale în acest volum publicat de CRC Press.

Cuprins

Basic Concepts of Recursive Programming. Methodology for Recursive Thinking. Runtime Analysis of Recursive Algorithms. Linear Recursion I. Linear Recursion II: Tail Recursion. Multiple Recursion I: Divide and Conquer. Multiple Recursion II: Puzzles and Fractals. Counting Problems. Mutual Recursion. Program Execution. Tail Recursion Revisited and Nested Recursion. Backtracking

Descriere scurtă

Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students.
Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty.
It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way.
It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner.
The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.
 

Notă biografică

Manuel Rubio-Sánchez received MS and PhD degrees in computer science from Universidad Politécnica de Madrid in 1997 and 2004, respectively. Since, he has had a faculty position at Universidad Rey Juan Carlos (Madrid, Spain), where he is currently an associate professor in the Superior Technical School of Computer Science. His teaching has focused on computer programming, ranging from introductory CS1 courses to more advanced courses on algorithms and data structures. He has published several research studies related to recursion in the computer science education conferences. His other research interests include machine learning, and exploratory data analysis and visualization. Finally, he has been a lecturer at St. Louis University (Madrid campus), and has carried out research visits at Université de Cergy-Pontoise (Paris), and the University of California, San Diego.
 For more information on the author, please visit https://sites.google.com/view/recursiveprogrammingintro/.

Recenzii

Recursion is a fundamental topic in computer science, but one that is frequently taught in a fragmented way as part of an introductory course and then set aside for such electives as discrete programming and difference equations. Rubio-Sánchez (Universidad Rey Juan Carlos, Spain) believes that there are better ways to approach a concept so powerfully connected to computation. His book provides a comprehensive and approachable treatment of recursive programming. The text contains mathematical proofs, as well as clear methods that students can follow to derive new results and expand their knowledge in areas the book may not cover. Many of the fundamental problems that recursion can solve are presented and discussed; more advanced problems are addressed through decomposition and analysis. The book also contains a section on algorithm analysis, which helps form the basis for more advanced material on computational complexity. This book is useful as a textbook for introductory programming courses when an instructor adopts a more fundamental approach than imperative programming, but it can also serve as a useful reference for those who wish to explore recursive programming on their own, or for algorithm designers in the industry.
--L. Benedicenti, University of New Brunswick (CHOICE)

Descriere

Recursion is an important problem-solving skill that is considered to be one of the most difficult topics to master by CS1/2 students. This book helps students assimilate its fundamental concepts by analyzing a large number of problems of different nature, covering classical problems found in the literature, as well as richer related problems.