Cantitate/Preț
Produs

Quick Recursion: Quick Programming

Autor David Matuszek
en Limba Engleză Paperback – 22 feb 2023
Recursion is the best tool for working with trees and graphs. But perhaps you’ve studied recursion and decided it’s too complicated. You just can’t think that way. That limits the kind of programming you can do.
Good news! Recursion is actually easy. It’s just badly taught.
See, many instructors talk about how the computer does it. They go on and on about what happens at each level of the recursion and how each level relates to other levels. The problem is that you can’t think in multiple levels. Nobody can. And you don’t have to.
This book will show you how you can write recursive programs. Once you understand a few simple rules, you will wonder why you ever thought recursion was complicated. You’ll be able to write recursive programs quickly and easily.
Well, as quick and easy as programming ever is, anyway.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 14733 lei  6-8 săpt. +5096 lei  4-10 zile
  CRC Press – 22 feb 2023 14733 lei  6-8 săpt. +5096 lei  4-10 zile
Hardback (1) 46821 lei  6-8 săpt.
  CRC Press – 22 feb 2023 46821 lei  6-8 săpt.

Din seria Quick Programming

Preț: 14733 lei

Preț vechi: 18018 lei
-18% Nou

Puncte Express: 221

Preț estimativ în valută:
2820 2939$ 2347£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25
Livrare express 29 noiembrie-05 decembrie pentru 6095 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781032417585
ISBN-10: 1032417587
Pagini: 160
Ilustrații: 14 Line drawings, black and white; 14 Illustrations, black and white
Dimensiuni: 138 x 216 x 12 mm
Greutate: 0.44 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Quick Programming


Public țintă

Professional Practice & Development, Professional Training, and Undergraduate Core

Notă biografică

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.

Cuprins

1. Understanding Recursion, 2. Data Structures, 3. Backtracking

Recenzii

“When a gifted teacher presents a new concept, they first cover every needed building block. The new concept becomes such a necessary and obvious extension of those building blocks, it feels like something you already knew.  That is how Dave Matuszek’s books read.  In sparse, concise language he tells you exactly what you most need to know about programming, and lays it all out so clearly and logically it seems inevitable. His cheerful, intuitive examples progress step by step from introductory to advanced stages carrying you along painlessly.
I cannot recommend this series highly enough to anyone wanting a quick primer on a language they have yet to use. Whether a computer science student or a self-taught programmer, there are treats in store.”
- Martha Palmer, Arts and Sciences Professor of Distinction for Linguistics, and the former Helen & Hubert Croft Professor of Engineering in the Computer Science Department, University of Colorado Boulder, USA.
“Dr. David Matuszek has written a great series of books on programming that will be of interest to many experienced programmers… These short, well-written books can help programmers master a new language or technique rapidly and have fun doing so.”
- Tim Finin, Willard and Lillian Hackerman Chair in Engineering and a Computer Science and Electrical Engineering professor at the University of Maryland, Baltimore County (UMBC).
 

Descriere

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.