000			01642nam a22002417a 4500
005			20240718100046.0
008			240718t2007 maua|||gr|||| 001 0 eng d
020			_a0321358287
040			_aCO-ETITC _cspa _dCO-ETITC _eRCAA2
082	0	4	_223 _a005.13 _bL666i
100	1	0	_aLevitin, Anany _98630
245			_aIntroduction to the design & analysis of algorithms / _cAnany Levitin.
250			_aSecond edition
260	3		_aBoston MA : _bPearson Education , _c2007.
300			_a562 páginas : _bilustraciones.
500			_aContiene: índice, apéndices, bibliografía y ejercicios.
505	2		_a1. Introduction.-- 2. Fundamentals of the Analysis of Algorithm Efficiency.-- 3. Brute Force.-- 4. Divide-and-Conquer.-- 5. Decrease-and-Conquer.-- 6. Transform-and-Conquer.-- 7. Space and Time Tradeofs.- 8. Dynamic Programming.-- 9. Greedy Technique.-- 10. Iterative Improvement.-- 11. Limitatios of Algorithm Power.-- 12. Coping with the Limitations of Algorith Power.--
520			_aBased on a new classification of algorithm design techniques and a clear delineation of analysis methods, "Introduction to the Design and Analysis of Algorithms" presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course.
650	1	4	_aAlgoritmos _xProgramación informática _98631
650	2	4	_aAlgoritmos informáticos _vEjercicios _98632
650	2	4	_aProgramación de computadoras _97680
942			_2ddc _cBK _h005.13 _kL666i
999			_c5460 _d5460