Robed Sedgewick擁有斯坦福大學博士學位(導師為Donald E. Knuth),昔林斯頓大學計算機科學係教授,Adobe Systems公司董事,曾是XeroxPARC的研究人員,還曾就職於美國國防部防禦分析研究所以及INRIA。除本書外,他還與Philippe Flajolet閤著瞭《算法分析導論》一書
"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.
發表於2024-06-01
Algorithms in C, Parts 1-4 2024 pdf epub mobi 電子書 下載
花瞭四個月時間,終於將此書第1-4部分讀完瞭,放下書的那一刻無比高興哈哈。 Robert Sedgewick老爺子真不是蓋的,對算法的講解清晰易懂,C語言程序簡短緊湊,令人稱絕,實際上很多算法實現堪稱完美:紅黑樹的插入,Batcher odd-event sort,漢諾伊的遞歸結構,背包的DP...
評分P32 錶2-4 “當M增加一倍時,順序搜索的時間也增加一倍,但二分搜索幾乎不變” 其中M當為N。 因為順序搜索的時間復雜度跟MN正比而二分搜索跟MlogN正比,顯而易見M增加時兩種算法耗時均綫性遞增。 嗯,我的評論很短麼?居然不讓發錶??好吧,我刷個屏看看。 刷屏刷屏刷屏刷...
評分在小百閤算法版看到 ufx222 對這本書的評價纔注意到這本書。引用他的評價: “隻推薦C語言的版本;而且不推薦看中文版,中文版翻譯得非常之差。這是一本非常重視算法實現的書,即使是資深的優化程序的人也不會對Sedgewick的C程序有不滿。作者對於基本算法都給瞭很多很多形象的...
評分花瞭四個月時間,終於將此書第1-4部分讀完瞭,放下書的那一刻無比高興哈哈。 Robert Sedgewick老爺子真不是蓋的,對算法的講解清晰易懂,C語言程序簡短緊湊,令人稱絕,實際上很多算法實現堪稱完美:紅黑樹的插入,Batcher odd-event sort,漢諾伊的遞歸結構,背包的DP...
評分現在剛剛看瞭105頁。忍不住吐槽兩句。 1. 定調: 書是好書。我也有《算法導論》,但感覺還是這本適閤入門。算法分析得非常仔細,能夠理解。 2. 吐槽 1) 書中的給齣代碼和作者官網提供的源碼各種bug。隻能算是給齣瞭思路。需要自己小心謹慎地修改。 2) 翻譯非常不流暢。...
圖書標籤: 算法 Algorithm C Algorithms 計算機 Programming 編程 c
非常好的算法入門書。書中的代碼示例非常豐富,而且實現得優雅、高效。
評分可讀性相當之不好
評分The code is far from fine grained
評分bug多
評分lecturer 寫的代碼比書裏的好太多瞭,一段時間的節點,我和C的估計還是繼續下去C++
Algorithms in C, Parts 1-4 2024 pdf epub mobi 電子書 下載