Robed Sedgewick拥有斯坦福大学博士学位(导师为Donald E. Knuth),昔林斯顿大学计算机科学系教授,Adobe Systems公司董事,曾是XeroxPARC的研究人员,还曾就职于美国国防部防御分析研究所以及INRIA。除本书外,他还与Philippe Flajolet合著了《算法分析导论》一书
发表于2024-05-18
Algorithms in C, Parts 1-4 2024 pdf epub mobi 电子书
Prof. Sedgewick is a noted authority on searching and sorting algorithms, and a former student of Knuth's. The text is authoritative, lucid, and detailed. It is also full of mistakes, poorly edited, and much of the code has serious and not so serious bugs. ...
评分翻译质量较差,像是未加任何处理的英文直译,不符合中文阅读习惯,另有不少不知所云的地方。如188页的《6.10 关键字索引统计》中有这样的叙述:“一种方法是计算0的个数,然后再次扫描输入a,使用两个表示统计数的一个数组,把元素分布在临时数组b中。”。为了不影响阅读,我一...
评分Prof. Sedgewick is a noted authority on searching and sorting algorithms, and a former student of Knuth's. The text is authoritative, lucid, and detailed. It is also full of mistakes, poorly edited, and much of the code has serious and not so serious bugs. ...
评分美国大学本科生课程“Algorithm and Data Structure”的指定教材,我偷懒,下了中文版来看,实在是忍不了翻译,看回英文版。明明很简单的一句话能叫译者说的不明所以。真是译成这样不如不译啊。。。
评分用图示化方式说明算法的特点,是本书的一大特色。 只是翻译者实在是欠骂,这么垃圾的翻译还不如不译,糟蹋了这么好的一本书!! 封面上都写上你的名字了,都不怕遭人骂吗?! 留给别人翻译多好啊!!
图书标签: 算法 Algorithm C Algorithms 计算机 Programming 编程 c
"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.." - Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive. - William A. Ward, University of South Alabama Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language. Highlights * Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures * Greater emphasis on abstract data types (ADTs) than in previous editions * Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations * New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more * Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them * Over 1000 new exercises to help you learn the properties of algorithms Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.
bug多
评分可读性相当之不好
评分非常好的算法入门书。书中的代码示例非常丰富,而且实现得优雅、高效。
评分附图很有特色,不错
评分非常好的算法入门书。书中的代码示例非常丰富,而且实现得优雅、高效。
Algorithms in C, Parts 1-4 2024 pdf epub mobi 电子书