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.
##正文毫不含糊 习题给自己深深虐了三个月 单看这本基本上脑袋大 需用算法导论压
##ds教材
##大体上不功不过,比较有条理,但是后面的章节有些部分过于简略不好理解。
##正文毫不含糊 习题给自己深深虐了三个月 单看这本基本上脑袋大 需用算法导论压
##教材,mark之
##教材,mark之
##大体上不功不过,比较有条理,但是后面的章节有些部分过于简略不好理解。
纸质书# 3.7 分。
纸质书# 3.7 分。