000			01415nam a2200205Ia 4500
003			NULRC
005			20250520102709.0
008			250520s9999 xx 000 0 und d
020			_a9780132576277
040			_cNULRC
050			_aQA 76.73.J38 .W45 2012
100			_aWeiss, Mark Allen _eauthor
245		0	_aData structures and algorithm analysis in Java / _cMark Allen Weiss
250			_aTHIRD EDITION
260			_aUpper Saddle River, New Jersey : _bPearson Education, _cc2012
300			_axx, 614 pages : _billustrations ; _c24 cm.
365			_bUSD132.08
520			_aIn this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. This new edition contains all the enhancements of the new Java 7 code including diamonds. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.
942			_2lcc _cBK
999			_c13254 _d13254