CHF 146.00

David Matuszek Quick Recursion Inglese · Copertina rigida

Spedizione di solito entro 1 a 3 settimane

Descrizione

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.

Info autore

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.

Riassunto

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.

Dettagli sul prodotto

Autori	David Matuszek
Editore	Taylor & Francis Ltd.

Contenuto	Libro
Forma del prodotto	Copertina rigida
Data pubblicazione	22.02.2023
Categoria	Scienze umane, arte, musica > Psicologia > Psicologia teorica Saggistica > Psicologia, esoterismo, spiritualità, antroposofia > Psicologia: tematiche generali, opere di consultaz Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Linguaggi di programmazione

EAN	9781032417592
ISBN	978-1-0-3241759-2
Numero di pagine	160

Serie	Quick Programming
Categorie	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

Recensioni dei clienti

Per questo articolo non c'è ancora nessuna recensione. Scrivi la prima recensione e aiuta gli altri utenti a scegliere.

Scrivi una recensione

Top o flop? Scrivi la tua recensione.