000			01704nam a2200217Ia 4500
005			20250128105631.0
008			230911s9999||||xx |||||||||||||| ||und||
020			_a9788173716126
040			_cNational Institute of Technology Goa
082			_a005.73 _bHOR/SAH
100			_aHorowitz, Ellis
110			_aSahni, Sartaj
111			_aRajasekaran, Sanguthevar
245		0	_aFundamentals of computer algorithms
250			_a2nd
260			_aNoida: _b University Press, _c 2012
300			_a786p.: 8x15x2; Paperback
520			_aAbout the book: This is the 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 non randomized algorithms is thoroughly compared.
650			_aComputer Science Engineering
942			_cBK _2ddc _n0
999			_c3446 _d3446