000			01460nam a2200217Ia 4500
003			NULRC
005			20250520094852.0
008			250520s9999 xx 000 0 und d
020			_a9780201455731
040			_cNULRC
050			_aQA 76.73.C15 .W45 1993
100			_aWeiss, Mark Allen _eauthor
245		0	_aData structures and algorithm analysis in C / _cMark Allen Weiss.
260			_aRedwood City, California : _bThe Benjamin/Cummings Publishing Company, Inc., _cc1993
300			_axvii, 455 pages : _billustrations ; _c21 cm.
504			_aIncludes bibliographical references and index.
505			_aIntroduction -- Algorithm analysis -- Lists, stacks, and queues -- Trees -- Hashing -- Priority queues (heaps) -- Sorting -- The disjoint set ADT -- Graph algorithms -- Algorithm design techniques -- Amortized analysis.
520			_aThis text takes a modern approach to algorithms and data structures. Emphasizing theory rather than code, it highlights conceptual topics with a focus on ADTs and analysis of algorithms for efficiency. In particular, the concentration is on specific programming problems and how careful implementation will improve program running time. Logically organized, it presents topics in a manageable order. Designed for students and professionals, it is suitable for an advanced data structures course or a first-year graduate course in algorithm analysis.
650			_aC (COMPUTER PROGRAM LANGUAGE)
942			_2lcc _cBK
999			_c4824 _d4824