000			01256cam a2200289 i 4500
001			19542632
003			KeNaZET
005			20240806132515.0
008			170307s2015 caua b 000 0 eng
010			_a 2017303117
020			_z9781793520432
040			_aDLC _beng _erda _cDLC
042			_apcc
050	0	0	_aQA76.9.A43 _bA76 2022
100	1		_aArora, Amrinder, _eauthor. _93334
245	1	0	_aAnalysis and design of algorithms / _cby Amrinder Arora.
250			_aSecond edition.
260			_aNew York: _bCognella Inc., _cC2022
300			_axvii, 140 pages ; _c26 cm
500			_aIncludes bibliographic references and Index.
505			_aIntroduction and bare essentials -- Asymptotic analysis and notation -- Data structures -- Divide and conquer -- Greedy method --Dynamic programming -- Graph traversal techniques -- Branch and beyond -- NP completeness -- Slaying the NP-Hardness dragon -- Theory of lower bounds -- Wrapping up.
650		0	_aComputer algorithms. _93335
650		0	_aCombinatorial analysis _xData processing. _93336
906			_a7 _bcbc _corignew _d2 _encip _f20 _gy-gencatlg
942			_2lcc _cBK _kQA76.9.A43 _mQA76.9.A43 _n.A76 2022
999			_c6084 _d6084