How to think about algorithms /

Mostrar otras versiones (1)

"This book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. Jeff Edmonds provides both the big picture and easy step-by-step methods for developing algorithms, while avoiding the common pitfalls. Paradigms such as loop invariants...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Edmonds, Jeff, 1963-
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, ©2008.
Temas:
Algorithms > Study and teaching.
Loops (Group theory) > Study and teaching.
Invariants > Study and teaching.
Recursion theory > Study and teaching.
Algorithmes > Étude et enseignement.
Lacets (Théorie des groupes) > Étude et enseignement.
Invariants > Étude et enseignement.
Théorie de la récursivité > Étude et enseignement.
MATHEMATICS > Numerical Analysis.
Algorithms > Study and teaching
Algorithmentheorie
Theoretische Informatik
Lehrbuch.
Acceso en línea:Texto completo
Descripción
Sumario:"This book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. Jeff Edmonds provides both the big picture and easy step-by-step methods for developing algorithms, while avoiding the common pitfalls. Paradigms such as loop invariants and recursion help to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly."--Jacket
Notas:Includes index.
Descripción Física:1 online resource (xiii, 448 pages) : illustrations
ISBN:9780511412783
0511412789
9780511413704
051141370X
9780511410451
051141045X
9780511649882
0511649886
9780511808241
0511808240
9781139637268
1139637266
1107175844
9781107175846
0511645791
9780511645792
9786612390289
661239028X
1282390287
9781282390287
0511568002
9780511568008

Ejemplares similares