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-12-23
Algorithms in C, Parts 1-4 2024 pdf epub mobi 電子書 下載
書是相當的好,翻譯的超級的爛啊,感覺是直譯的,直接按照英文單詞順序翻譯過來的,還有翻譯錯誤的地方,簡直無語瞭,拿本詞典自己看也比看中文的強。 還建議看看那本算法分析導論,數學知識比較多,寫的很好,不愧是算法大師和算法大師的高徒啊,嗬嗬。
評分書是好書,不過還是推薦看原版的,翻譯得實在。。。而且明顯感覺不同的章節是不同的人翻的,雖然隻寫瞭一個譯者
評分也許關於算法方麵的最大的誤解,就是沒有意識到它是由關係密切而又非常不同的兩個部分組成的。 對於一個給定的問題,選擇哪一種算法纔是最適閤的?選定算法之後,在編程環境中又是如何實現這個算法,是使用已有的庫還是自己從頭開始編寫,是用 X 語言還是 Y 語言?這個算法實...
評分花瞭四個月時間,終於將此書第1-4部分讀完瞭,放下書的那一刻無比高興哈哈。 Robert Sedgewick老爺子真不是蓋的,對算法的講解清晰易懂,C語言程序簡短緊湊,令人稱絕,實際上很多算法實現堪稱完美:紅黑樹的插入,Batcher odd-event sort,漢諾伊的遞歸結構,背包的DP...
評分從今天開始讀這本書,不過讀的是電子版。到目前為止書中的程序幾乎都是可執行的。在這點上,比用僞代碼實現的那些大牛著作更適閤新手。而且有一些程序配有執行結果圖。 今天在做P58的The Sieve of Eratosthenes的時候,我做瞭一個檢驗,發現如果完全按照書上的程序,...
圖書標籤: 算法 Algorithm C Algorithms 計算機 Programming 編程 c
A great read.
評分對各種算法之間的聯係的介紹尤為精彩。
評分可讀性相當之不好
評分lecturer 寫的代碼比書裏的好太多瞭,一段時間的節點,我和C的估計還是繼續下去C++
評分附圖很有特色,不錯
Algorithms in C, Parts 1-4 2024 pdf epub mobi 電子書 下載