000			01513nmm a2200181Ia 4500
008			220920s9999||||xx |||||||||||||| ||und||
020			_a9780511808241
082			_a518.1 _bEd57H
100			_aEdmonds, Jeff. _eAuthor _lEnglish _91858
245		0	_aHow to Think About Algorithms _c/ by Jeff Edmonds. _h[Electronic Resource]
260			_aCambridge _b: Cambridge University Press, _c2008
300			_axiv, 448p.
520			_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.
650			_aAlgorithmics _915721
650			_aComplexity _915722
856			_uhttps://doi.org/10.1017/CBO9780511808241 _qPDF _yClick to Access the Online Book
942			_cEBK _nYes
999			_c12243 _d12243