000			01410 a2200193 4500
005			20190114145039.0
008			190104b xxu||||| |||| 00| 0 eng d
020			_a9781107439887
040			_cIIT Kanpur
041			_aeng
082			_a518.1 _bEd56h
100			_aEdmonds, Jeff
245			_aHow to think about algorithms _cJeff Edmonds
260			_bCambridge University Press _c2008 _aNew Delhi
300			_axiii, 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			_aAlgorithms-study and teaching
942			_cBK
999			_c559948 _d559948