000			01598cam a2200277 a 4500
008			090715s1998 maua b 001 0 eng
010			_a97028337
020			_a9780763706203
035			_a(Sirsi) u2139
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a005.1 _2 21
100	1		_aNeapolitan, Richard E. _93676
245	1	0	_aFoundations of algorithms using C++ pseudocode / _c Richard E. Neapolitan, Kumarss Naimipour.
250			_a2nd ed.
260			_aSudbury, Mass. : _b Jones and Bartlett Publishers, _c c1998.
300			_axv, 523 p. : _b ill. ; _c 25 cm.
500			_aRev. ed. of: Foundations of algorithms. Lexington, Mass. : D.C. Heath, c1996.
504			_aIncludes bibliographical references (p. 513-515) and index.
520			_aFoundations of Algorithms Using C++ Pseudocode offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, & computational complexity that is accessible to mainstream computer science students who have a background in college algebra & discrete structures. To support their approach, the authors present mathematical concepts using Standard English & a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. In addition, they reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
650		0	_aAlgorithms. _93677
650		0	_aConstructive mathematics. _93678
650		0	_aComputational complexity. _9993
700	1		_aNaimipour, Kumarss. _93679
596			_a1
999			_c1237 _d1237