000			01818 a2200241 4500
008			140323b2008 xxu||||| |||| 00| 0 eng d
020			_a9788173716126
082			_a519.92
100			_aHorowitz, Ellis _932346
245			_aFundamentals of computer algorithms _cHorowitz, Ellis
250			_a2nd ed.
260			_aHyderabad _bUniversity Press _c2008 _9139289
300			_axx, 773 p.
365			_bINR 360.00
440			_aComputer software engineering series _932347
520			_aThis is the thoroughly revised and updated edition of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. The second edition of Fundamentals of Computer Algorithms emphasizes: Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed. Examples: A wide range of examples provides students with the actual implementation of correct design. The latest research: A thorough treatment of probabilistic and parallel algorithms is included. Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.
650			_aElectronic digital computers - Programming
650			_aAlgorithms
700			_aSahni, Sartaj _91150479
700			_aRajasekaran, Sanguthevar _957710
942			_cBK
999			_c365650 _d365650