Edmonds, Jeff,  1963- <br/><br/>
How to think about algorithms  [electronic resource] / 
Jeff Edmonds. 
 - Cambridge ;  New York :  Cambridge University Press,  2008. 
 - 1 online resource (xiii, 488 p.) :  ill. 
<br/><br/> Includes index. 
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9781139637268 1139637266 
<br/><br/><label>Source: </label>CL0500000282  Safari Books Online 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms--Study and teaching.<br/>Loops (Group theory)--Study and teaching.<br/>Invariants--Study and teaching.<br/>Recursion theory--Study and teaching.
<br/><br/><label>Index Terms--Genre/Form: </label><br/>Electronic books.