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.
##读本科的时候看了一遍中文版,结果读Master又认真读了一遍英文版。
评分##大体上不功不过,比较有条理,但是后面的章节有些部分过于简略不好理解。
评分##教材,mark之
评分##大体上不功不过,比较有条理,但是后面的章节有些部分过于简略不好理解。
评分##稍微翻了一下,适合入门看
评分##ds教材
评分##给你一个数据结构的实现,再给你几个例子,好了,做题。hhhh 总的来说是一本不错的书,源代码必须好评(虽然C语言的特性决定了其算法实现必须额外注意底层,会造成干扰)。目前基本的数据结构、排序算法和遍历算法都过了一遍,先结合源代码把这些东西上机实现一遍,再用笔手写一遍再上手贪心算法和动归吧。
评分##ds教材
评分##稍微翻了一下,适合入门看
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 tushu.tinynews.org All Rights Reserved. 求知書站 版权所有