000			01689cam a2200313 a 4500
001			15938445
005			20231228130521.0
008			091009s2011 mau b 001 0 eng
010			_a 2009040309
020			_a9780763782504 (casebound)
020			_a0763782505 (casebound)
040			_aDLC _cDLC _dDLC
050	0	0	_aQA9.58 _b.N43 2011
082	0	0	_a518.1,NEA _222
100	1		_aNeapolitan, Richard E. _939111
245	1	0	_aFoundations of algorithms / _cRichard Neapoltian, Kumarss Naimipour.
250			_a4th ed.
260			_aSudbury, Mass. : _bJones and Bartlett Publishers, _cc2011.
300			_axv, 627 p. L _bill. ; _c24 cm.
505	0		_aAlgorithms: efficiency, analysis, and order (Page-1), Divide-and-conquer (Page-47), Dynamic programming (Page-91), The greedy approach (Page-145), Backtracking (Page-197), Branch-and-bound (Page-243), Introduction to computational complexity : the sorting problem (Page-277), More computational complexity : the searching problem (Page-329), Computational complexity and intractability : an introduction to the theory of NP (Page-385), Number-theoretic algorithms (Page-429), Introduction to parallel algorithms (Page-495), .
650		0	_aAlgorithms. _913771
650		0	_aConstructive mathematics. _939113
650		0	_aComputational complexity. _939112
700	1		_aNaimipour, Kumarss. _939114
700	1		_aNeapolitan, Richard E. _tFoundations of algorithms using C++ pseudocode. _9103149
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK _k518.1,NEA
999			_c592414 _d592414