| Description |
1 online resource (xiii, 448 pages) : illustrations |
|
data file |
| Physical Medium |
polychrome |
| Contents |
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. |
| Note |
Includes index. |
| Summary |
"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. |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Algorithms -- Study and teaching.
|
|
Algorithms -- Study and teaching. |
|
Algorithms. |
|
Loops (Group theory) -- Study and teaching.
|
|
Loops (Group theory) |
|
Invariants -- Study and teaching.
|
|
Invariants. |
|
Recursion theory -- Study and teaching.
|
|
Recursion theory. |
| Genre/Form |
Electronic books.
|
|
Lehrbuch.
|
|
Electronic books.
|
| Other Form: |
Print version: Edmonds, Jeff, 1963- How to think about algorithms. Cambridge ; New York : Cambridge University Press, 2008 9780521849319 (DLC) 2008001238 (OCoLC)190843470 |
| ISBN |
9780511412783 (ebook) |
|
0511412789 (ebook) |
|
9780511413704 (ebook) |
|
051141370X (ebook) |
|
9780511410451 (electronic book ; Adobe Reader) |
|
051141045X (electronic book ; Adobe Reader) |
|
9780511649882 (electronic book) |
|
0511649886 (electronic book) |
|
9780511808241 (electronic book) |
|
0511808240 (electronic book) |
|
9781139637268 |
|
1139637266 |
|
9780521849319 (hardback) |
|
0521849314 (hardback) |
|
9780521614108 (paperback) |
|
0521614104 (paperback) |
|
