具体描述
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.
用户评价
##稍微翻了一下，适合入门看
评分##大体上不功不过，比较有条理，但是后面的章节有些部分过于简略不好理解。
评分##正文毫不含糊 习题给自己深深虐了三个月 单看这本基本上脑袋大 需用算法导论压
评分##用自己的想法把 Data Structure 主要脉络整理出来的时候发现几乎不可避免地与原书重合或者发觉原书是更优的讲解方式，我想称为经典不为过。
评分##少一星给翻译
评分##code examples buggy and malformed, problems/algorithms vaguely defined.
评分##读本科的时候看了一遍中文版，结果读Master又认真读了一遍英文版。
评分纸质书# 3.7 分。
评分##code examples buggy and malformed, problems/algorithms vaguely defined.
相关图书
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 tushu.tinynews.org All Rights Reserved. 求知書站 版权所有