ISBN: 9781041149538 - recursion: mathematics and python (6 resultados)
- Tapa dura
Librería: Books From California, Simi Valley, CA, Estados Unidos de AmericaBooks From California
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Bueno
EUR 84,24
Envío por EUR 4,45Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponible
hardcover. Condición: Very Good.
- Tapa dura
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 140,15
Envío por EUR 7,79Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
- Tapa dura
Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 159,38
Envío por EUR 3,56Se envía dentro de Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
- Tapa dura
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 160,98
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
- Tapa dura
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 130,38
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Yung-Hsiang Lu is a professor and University Faculty Scholar at Purdue University. He was the inaugural director of the John Martinson Engineering Entrepreneurial Center in 2020. He is a Fellow of IEEE, Distinguished Visitor of the Computer Societ.
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 174,98
Envío por EUR 35,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. Neuware - Recursion: Mathematics and Python is designed to help readers develop a clear and systematic understanding of recursion as both a mathematical concept and a programming technique. Rather than presenting recursion as a collection of isolated examples, the book emphasizes recursive thinking: how complex problems can be expressed, analyzed, and solved by breaking them into simpler instances of similar structures.The book adopts a consistent pedagogical approach throughout. Each topic begins with a mathematical or conceptual formulation that highlights the recursive structure of the problem. Readers are guided to identify parameters, base cases, and recursive relationships before translating these ideas into Python programs. Examples are chosen to identify recurring patterns across domains, including integer partitions, Tower of Hanoi, parentheses counting, binary search, quick sort, Sudoku solving, maze traversal, tree structures, and data compression. Code examples are written for clarity. Readers can follow execution flow and understand how recursive calls interact with computer memory. This book also explains how to reduce the recursion time by identifying and removing redundant computation.This book is intended for undergraduate students in computer science and computer engineering who already have basic Python programming experience and some prior exposure to recursion. It is well suited for courses in programming, discrete mathematics, data structures, or algorithms. This book can also help instructors seek a resource that tightly integrates mathematical reasoning with executable code.…
