LEADER 04024nam  22007092  450 
001 9910782417503321
005 20151005020622.0
010   $a1-107-17584-4
010   $a0-511-64579-1
010   $a9786612390289
010   $a1-282-39028-7
010   $a1-139-63726-6
010   $a0-511-80824-0
010   $a0-511-64988-6
010   $a0-511-41278-9
010   $a0-511-56800-2
010   $a0-511-41370-X
035   $a(CKB)1000000000690162
035   $a(EBL)352970
035   $a(OCoLC)476173558
035   $a(SSID)ssj0000338774
035   $a(PQKBManifestationID)11252293
035   $a(PQKBTitleCode)TC0000338774
035   $a(PQKBWorkID)10298607
035   $a(PQKB)11312634
035   $a(UkCbUP)CR9780511808241
035   $a(MiAaPQ)EBC352970
035   $a(Au-PeEL)EBL352970
035   $a(CaPaEBR)ebr10240295
035   $a(CaONFJC)MIL239028
035   $a(PPN)156193353
035   $a(EXLCZ)991000000000690162
100   $a20101021d2008||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aHow to think about algorithms /$fJeff Edmonds$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2008.
215   $a1 online resource (xiii, 448 pages) $cdigital, PDF file(s)
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a0-521-61410-4 
311   $a0-521-84931-4 
327   $aIterative 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.
330   $aThis textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
606   $aAlgorithms$xStudy and teaching
606   $aLoops (Group theory)$xStudy and teaching
606   $aInvariants$xStudy and teaching
606   $aRecursion theory$xStudy and teaching
615  0$aAlgorithms$xStudy and teaching.
615  0$aLoops (Group theory)$xStudy and teaching.
615  0$aInvariants$xStudy and teaching.
615  0$aRecursion theory$xStudy and teaching.
676   $a518/.1
700   $aEdmonds$b Jeff$f1963-$01542948
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910782417503321
996   $aHow to think about algorithms$93796126
997   $aUNINA