发表于2025-04-15
Mark Allen Weiss,1987年在普林斯顿大学获得计算机科学博士学位,师从Robert Sedgewick (师从Knuth),现任美国佛罗里达国际大学计算与信息科学学院教授。他曾经担任全美AP(Advanced Placement)考试计算机学科委员会的主席(2000-2004)。他的主要研究方向是数据结构、算法和教育学。
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 Structures and Algorithm Analysis in C (2nd Edition) 下载 mobi pdf epub txt 电子书 格式 2025
Data Structures and Algorithm Analysis in C (2nd Edition) 下载 mobi epub pdf 电子书##正文毫不含糊 习题给自己深深虐了三个月 单看这本基本上脑袋大 需用算法导论压
评分 评分 评分##我看的是中文版的,hash table那一章,第114頁。我就直奔主題了啊。 中文版里是這樣說的: 我們程序的一個低效之處在於第12行上的malloc執行了H->TableSize次。這可以通過循環出現之前調用一次malloc操作。 H->TheLists = malloc(H->TableSize * sizeof(struct ListNode)); ...
评分##少一星给翻译
评分 评分Data Structures and Algorithm Analysis in C (2nd Edition) mobi epub pdf txt 电子书 格式下载 2025