| Description |
1 online resource (xiii, 448 pages) : illustrations |
| 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 |
| 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 |
| Notes |
Includes index |
|
English |
|
Print version record |
| Subject |
Algorithms -- Study and teaching
|
|
Loops (Group theory) -- Study and teaching
|
|
Invariants -- Study and teaching
|
|
Recursion theory -- Study and teaching
|
|
MATHEMATICS -- Numerical Analysis.
|
|
Algorithms -- Study and teaching
|
|
Algorithmentheorie
|
|
Theoretische Informatik
|
| Genre/Form |
Lehrbuch.
|
| Form |
Electronic book
|
| LC no. |
2008001238 |
| ISBN |
9780511412783 |
|
0511412789 |
|
9780511413704 |
|
051141370X |
|
9780511410451 |
|
051141045X |
|
9780511649882 |
|
0511649886 |
|
9780511808241 |
|
0511808240 |
|
9781139637268 |
|
1139637266 |
|
1107175844 |
|
9781107175846 |
|
0511645791 |
|
9780511645792 |
|
9786612390289 |
|
661239028X |
|
1282390287 |
|
9781282390287 |
|
0511568002 |
|
9780511568008 |
|
