000 01216nam a2200229 a 4500
001 ASIN0201498405
003 AUCL
005 20210322134102.0
008 140910s1996 xxu eng d
020 _a9788177583588
040 _cAUKP
082 _a005.73 WEI
100 1 _aWeiss, Mark Allen.
_95496
245 1 0 _aData structures and Algorithm Analysis in C
250 _a2nd ed.
260 _bPearson
_c1997
300 _a527 p.
520 _aMark Allen Weiss' successful book provides a modern approach to algorithms and data structures using the C programming language. The book's conceptual presentation focuses on ADTs and the analysis of algorithms for efficiency, with a particular concentration on performance and running time. The second edition contains a new chapter that examines advanced data structures such as red black trees, top down splay trees, treaps, k-d trees, and pairing heaps among others. All code examples now conform to ANSI C and coverage of the formal proofs underpinning several key data structures has been strengthened.
830 0 _a2nd edition.
_95497
856 4 0 _3Amazon.com
_uhttp://www.amazon.com/exec/obidos/ASIN/0201498405/chopaconline-20
942 _2ddc
_cBK
999 _c24633
_d24633