Cargando…
Python Algorithms : mastering basic algorithms in the python language /
Python Algorithms explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. The book de...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
[New York, N.Y.] :
Apress,
©2010.
|
| Colección: | Expert's voice in open source.
|
| Temas: | |
| Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
Tabla de Contenidos:
- Title Page ; Copyright Page ; Contents at a Glance; Table of Contents ; About the Author; About the Technical Reviewer; Acknowledgments; Preface; CHAPTER 1 Introduction; What's All This, Then?; Why Are You Here?; Some Prerequisites; What's in This Book; Summary; If You're Curious ... ; Exercises; References; CHAPTER 2 The Basics; Some Core Ideas in Computing; Asymptotic Notation; It's Greek to Me!; Rules of the Road; Taking the Asymptotics for a Spin; Three Important Cases; Empirical Evaluation of Algorithms; Implementing Graphs and Trees; Adjacency Lists and the Like.
- Adjacency Matrices Implementing Trees; A Multitude of Representations; Beware of Black Boxes; Hidden Squares; The Trouble with Floats; Summary; If You're Curious ... ; Exercises; References; CHAPTER 3 Counting 101; The Skinny on Sums; More Greek; Working with Sums; A Tale of Two Tournaments; Shaking Hands; The Hare and the Tortoise; Subsets, Permutations, and Combinations; Recursion and Recurrences; Doing It by Hand; A Few Important Examples; Guessing and Checking; The Master Theorem: A Cookie-Cutter Solution; So What Was All That About?; Summary; If You're Curious ... ; Exercises; References.
- CHAPTER 4 Induction and Recursion ... and Reduction Oh, That's Easy!; One, Two, Many; Mirror, Mirror; Designing with Induction (and Recursion); Finding a Maximum Permutation; The Celebrity Problem; Topological Sorting; Stronger Assumptions; Invariants and Correctness; Relaxation and Gradual Improvement; Reduction + Contraposition = Hardness Proof; Problem Solving Advice; Summary; If You're Curious ... ; Exercises; References; CHAPTER 5 Traversal: The Skeleton Key of Algorithmics; A Walk in the Park; No Cycles Allowed; How to Stop Walking in Circles; Go Deep!
- Depth-First Timestamps and Topological Sorting (Again) Infinite Mazes and Shortest (Unweighted) Paths; Strongly Connected Components; Summary; If You're Curious ... ; Exercises; References; CHAPTER 6 Divide, Combine, and Conquer; Tree-Shaped Problems: All About the Balance; The Canonical D & C Algorithm; Searching by Halves; Traversing Search Trees ... with Pruning; Selection; Sorting by Halves; How Fast Can We Sort?; Three More Examples; Closest Pair; Convex Hull; Greatest Slice; Tree Balance ... and Balancing* Summary; If You're Curious ... ; Exercises; References.
- CHAPTER 7 Greed Is Good? Prove It! Staying Safe, Step by Step; The Knapsack Problem; Fractional Knapsack; Integer Knapsack; Huffman's Algorithm; The Algorithm; The First Greedy Choice; Going the Rest of the Way; Optimal Merging; Minimum spanning trees; The Shortest Edge; What About the Rest?; Kruskal's Algorithm; Prim's Algorithm; Greed Works. But When?; Keeping Up with the Best; No Worse Than Perfect; Staying Safe; Summary; If You're Curious ... ; Exercises; References; CHAPTER 8 Tangled Dependencies and Memoization; Don't Repeat Yourself; Shortest Paths in Directed Acyclic Graphs.