000			01305 a2200181 4500
999			_c3 _d3
005			20220321152757.0
008			200907b ||||| |||| 00| 0 eng d
020			_a9788173716126
082			_a004.421 _bHOR
100			_aHorowitz Ellis
245			_aFundamentals of Computer Algorithms _cEllis Horowitz
250			_a2 nd Ed.
260			_bUniversities Press _c2008 _aChennai
300			_axx,773p. _c23cm
505			_t1 INTRODUCTION _t2 ELEMENTARY DATA STRUCTURES _t3. DIVIDE AND CONQUER _t4 THE GREEDY METHOD _t5 DYNAMIC PROGRAMMING _t6 BASIC TRAVERSAL AND SEARCH TECHNIQUES _t7 BACKTRACKING _t8 BRANCH AND BOUND _t9 ALGEBRAIC PROBLEMS _t10 LOWER BOUND THEORY _t 11 NP-HARD AND NP-COMPLETE PROBLEMS _t12 APPROXIMATION ALGORITHMS _t13 PRAM ALGORITHMS _t14.MESH ALGORITHMS _t15.HYPERCUBE ALGORITHMS
520			_aThis 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.
942			_cBK _2ddc