Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 3/e (Paperback)

"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.

• 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.

「這是一本非常易讀的書，一般的程式設計師，即使對數學分析不熟悉且對理論演算法持懷疑態度，也應該能夠輕鬆上手並從中獲益良多。」- Steve Summit，《C Programming FAQs》作者

「Sedgewick 在解釋概念方面具有真正的天賦，使它們易於理解。在書中以頁面大小（或更小）的真實程式片段作為示例，這是一個真正的優勢。圖表、程式和表格對讀者的學習體驗有重要的貢獻，使這本書與眾不同。」- William A. Ward，南阿拉巴馬大學

Robert Sedgewick 徹底重寫並大幅擴充了他的熱門作品，以提供關於重要演算法和資料結構的最新且全面的涵蓋範圍。書中介紹了許多新的演算法，並且對每個演算法的解釋比以前的版本更加詳細。新的文字設計和詳細的創新圖表以及相應的評論，大大增強了內容的呈現方式。第三版保留了理論和實踐的成功結合，使 Sedgewick 的作品成為超過 250,000 名程式設計師的寶貴資源！

這本書的第一部分至第四部分代表了 Sedgewick 完整作品的重要前半部分。它廣泛涵蓋了基本的資料結構和排序、搜尋以及相關應用的演算法。演算法和資料結構以簡潔的 C 語言實現，讓您既能理解它們的基本特性，又能在實際應用中測試它們。當然，本書的內容適用於任何程式設計語言。

重點如下：
- 擴展了對陣列、鏈結串列、字串、樹和其他基本資料結構的涵蓋範圍
- 與以往版本相比，更加強調抽象資料類型（ADT）
- 提供了超過 100 個排序、選擇、優先佇列 ADT 實現和符號表 ADT（搜尋）實現的演算法
- 新增了二項佇列、多路基數排序、Batcher's 排序網絡、隨機化二元搜尋樹、伸展樹、跳躍表、多路字典樹等的新實現
- 提供了更多關於演算法的量化資訊，包括廣泛的實證研究和基本的分析研究，讓您能夠進行比較
- 提供了超過 1000 個新的練習題，幫助您學習演算法的特性

無論您是初次學習演算法的學生還是對最新參考資料感興趣的專業人士，您都能在這本書中找到豐富而有用的資訊。