000			00865nam a22001457a 4500
008			210119b ||||| |||| 00| 0 eng d
020			_a978-1-25-902582-2
082			_223 _a518.1 _bLEE
100			_aLee R.C.T
245			_aIntroduction to the Design And Analysis of Algorithms _bA Strategic Approach _cR.C.T Lee,S.S Tseng,R.C Chang,et.al _henglish
260			_aNew Delhi _bTata McGraw Hill Education Pvt Ltd _c2012
300			_a723p. ; _bSoft bound _c18*24 cm
505			_aPreface 1 Introduction 2 The complexity of algorithms and the lower bounds of problems 3 The greedy method 4 The divide-and-conquer strategy 5 Tree searching strategies 6 Prune-and-search 7 Dynamic programming 8 The theory of NP-completeness 9 Approximation algorithms 10 Amortized analysis 11 Randomized algorithms 12 On-line algorithms
942			_2ddc _cBK
999			_c6489 _d6489