CHF 146.00

David Matuszek Quick Recursion Englisch · Fester Einband

Versand in der Regel in 1 bis 3 Wochen

Beschreibung

Recursion is considered to be an "advanced" topic. It shouldn't be. While this little volume covers a number of advanced topics that involve recursion - tail recursion, pruning, recursive data structures, the use of accumulators, and backtracking - this book shows how recursion itself is actually rather simple.

Über den Autor / die Autorin

David L. Matuszek was Director of the Masters in Computer and Information Technology course at the University of Pennsylvania, USA (2001-2017). With 40 years teaching experience, and 45 years programming experience, David is skilled in both the design of innovative software systems and in teaching others how to master programming languages in an accessible and engaging way.

Zusammenfassung

Recursion is considered to be an “advanced” topic. It shouldn’t be. While this little volume covers a number of advanced topics that involve recursion - tail recursion, pruning, recursive data structures, the use of accumulators, and backtracking - this book shows how recursion itself is actually rather simple.

Produktdetails

Autoren	David Matuszek
Verlag	Taylor & Francis Ltd.

Inhalt	Buch
Produktform	Fester Einband
Erscheinungsdatum	22.02.2023
Thema	Geisteswissenschaften, Kunst, Musik > Psychologie > Theoretische Psychologie Sachbuch > Psychologie, Esoterik, Spiritualität, Anthroposoph > Psychologie: Allgemeines, Nachschlagewerke Naturwissenschaften, Medizin, Informatik, Technik > Informatik, EDV > Programmiersprachen

EAN	9781032417592
ISBN	978-1-0-3241759-2
Anzahl Seiten	160

Serie	Quick Programming
Themen	Software Engineering, COMPUTERS / Programming / Games, Computer architecture & logic design, Programming & scripting languages: general, Computer architecture and logic design, Programming and scripting languages: general, COMPUTERS / Languages / General, Computer Science Education, Algorithm Analysis, Collatz conjecture, problem solving strategies, Binary tree, Parse Tree, Recursive definition, Recursive Function, computational thinking skills, depth first search, Left Subtree, Recursive Case, data structure traversal, recursive algorithm design for students, Leaf Node, Introductory Programming Courses, Binary Tree Search, Frogs Accumulator, Recursive Routines, Public String toString, recursive programs, String Representation, Left Child, Int Country, Good Leaf, Recursive Call, Backtracking Algorithm, Recursive Data Structures, tail recursion, Goal Node, Debugging Statements, Object Obj

Kundenrezensionen

Zu diesem Artikel wurden noch keine Rezensionen verfasst. Schreibe die erste Bewertung und sei anderen Benutzern bei der Kaufentscheidung behilflich.

Schreibe eine Rezension

Top oder Flop? Schreibe deine eigene Rezension.