Mark 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.
No comments:
Post a Comment