Cargando…
How to think about algorithms /
"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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2008.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Iterative algorithms: measures of progress and loop invariants
- Examples using more-of-the-input loop invariants
- Abstract data types
- Narrowing the search space: binary search
- Iterative sorting algorithms
- Euclid's GCD algorithm
- The loop invariant for lower bounds
- Abstractions, techniques, and theory
- Some simple examples of recursive algorithms
- Recursion on trees
- Recursive images
- Parsing with context-free grammars
- Definition of optimization problems
- Graph search algorithms
- Network flows and linear programming
- Greedy algorithms
- Recursive backtracking
- Dynamic programming algorithms
- Examples of dynamic programs
- Reductions and NP-completeness
- Randomized algorithms
- Existential and universal quantifiers
- Time complexity
- Logarithms and exponentials
- Asymptotic growth
- Adding-made-easy approximations
- Recurrence relations
- A formal proof of correctness.