Data Structures and Algorithm Analysis in C++, 4/e (IE-Paperback)

<本書特色>

•This text is designed to teach students good programming and algorithm analysis skills simultaneously so that they can develop intricate programs with the maximum amount of efficiency.
•By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible and see how careful implementations can reduce the time constraint for large amounts of data. No algorithm or data structure is presented without an explanation of its running time.
•This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. As introductory sequences expand from two to three courses, this book is ideal at the end of the third course, bridging the way to the Algorithms course.
•Discussion of algorithm and design techniques covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.
•Covers topics and data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.
•A full chapter on amortized analysis examines the advanced data structures presented earlier in the book.
•Chapter on advanced data structures and their implementation covers red black trees, top down splay trees, k-d trees, pairing heaps, and more.
•End-of-chapter exercises, ranked by difficulty, reinforce the material from the chapter while providing readers an opportunity to put those concepts into practice.

New To This Edition
The fourth edition incorporates numerous bug fixes, and many parts of the book have undergone revision to increase the clarity of presentation. In addition,
•Chapter 4 includes implementation of the AVL tree deletion algorithm–a topic often requested by readers.
•Chapter 5 has been extensively revised and enlarged and now contains material on two newer algorithms: cuckoo hashing and hopscotch hashing. Additionally, a new section on universal hashing has been added. Also new is a brief discussion of the unordered_set and unordered_map class templates introduced in C++11.
•Chapter 6 is mostly unchanged; however, the implementation of the binary heap makes use of move operations that were introduced in C++11.
•Chapter 7 now contains material on radix sort, and a new section on lower-bound proofs has been added. Sorting code makes use of move operations that were introduced in C++11.
•Chapter 8 uses the new union/find analysis by Seidel and Sharir and shows the O( M α(M,N) ) bound instead of the weaker O( Mlog∗ N ) bound in prior editions.
•Chapter 12 adds material on suffix trees and suffix arrays, including the linear-time suffix array construction algorithm by Karkkainen and Sanders (with implementation). The sections covering deterministic skip lists and AA-trees have been removed.
•Throughout the text, the code has been updated to use C++11. Notably, this means use of the new C++11 features, including the auto keyword, the range for loop, move construction and assignment, and uniform initialization.

<作者簡介>

Mark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. He received his Bachelor’s Degree in Electrical Engineering from the Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987 and was promoted to Professor in 1996. His interests include data structures, algorithms, and education. He is most well-known for his highly-acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students.

Professor Weiss is the author of numerous publications in top-rated journals and was recipient of the University’s Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which is now the de facto standard. From 1997-2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000-2004. The committee designed the curriculum and wrote the AP exams that were taken by 20,000 high school students annually.

In addition to his Research Award in 1994, Professor Weiss is also the recipient of the University’s Excellence in Teaching Award in 1999 and the School of Computing and Information Science Excellence in Teaching Award (2005) and Excellence in Service Award (2007).

<本書目錄>

Chapter 1 Programming: A General Overview
Chapter 2 Algorithm Analysis
Chapter 3 Lists, Stacks, and Queues
Chapter 4 Trees
Chapter 5 Hashing
Chapter 6 Priority Queues (Heaps)
Chapter 7 Sorting
Chapter 8 The Disjoint Sets Class
Chapter 9 Graph Algorithms
Chapter 10 Algorithm Design Techniques
Chapter 11 Amortized Analysis
Chapter 12 Advanced Data Structures and Implementation
Appendix A Separate Compilation of Class Templates

本書特色:
- 本書旨在同時教授學生良好的程式設計和演算法分析技巧，以便他們能夠以最高效率開發複雜的程式。
- 通過在編寫程式碼之前分析演算法，學生可以判斷特定解決方案的可行性，並了解仔細實現如何減少處理大量數據的時間限制。書中介紹的演算法和資料結構都有其運行時間的解釋。
- 本書適用於高級資料結構（CS7）課程或研究生算法分析課程。隨著入門課程從兩門擴展到三門，本書在第三門課程結束時非常理想，為算法課程鋪平道路。
- 討論的演算法和設計技巧包括貪婪演算法、分治演算法、動態規劃、隨機演算法和回溯法。
- 涵蓋的主題和資料結構包括費波那契堆、斜堆、二項隊列、跳躍表和伸展樹。
- 全章節的攤銷分析探討了書中先前介紹的高級資料結構。
- 關於高級資料結構及其實現的章節涵蓋了紅黑樹、自頂向下伸展樹、k-d樹、配對堆等。
- 每章結束時的練習按難度排序，強化了該章節的內容，同時為讀者提供了將這些概念應用到實踐中的機會。

新版特色:
- 第四版修正了許多錯誤，並對書中的許多部分進行了修訂，以提高呈現的清晰度。
- 第四章包括AVL樹刪除演算法的實現，這是讀者經常要求的主題。
- 第五章經過廣泛修訂和擴充，現在包含了兩個較新的演算法：cuckoo雜湊和hopscotch雜湊。此外，還新增了一節關於通用雜湊的討論。同時新增了一個簡短介紹C++11中引入的unordered_set和unordered_map類模板的部分。
- 第六章基本上沒有改變，但二元堆的實現使用了C++11中引入的移動操作。
- 第七章現在包含了基數排序的內容，並新增了一節關於下界證明的部分。排序代碼使用了C++11中引入的移動操作。
- 第八章使用Seidel和Sharir提出的新的聯合/查找分析，並展示了O(Mα(M,N))的界限，而不是之前版本中較弱的O(Mlog*N)界限。
- 第十二章增加了關於後綴樹和後綴數組的內容，包括Karkkainen和Sanders提出的線性時間後綴數組構建演算法（附帶實現）。刪除了關於確定性跳躍表和AA樹的部分。
- 在整本書中，代碼已更新為使用C++11。特別是使用了新的C++11功能，包括auto關鍵字、範圍for循環、移動構造和賦值，以及統一初始化。

作者簡介:
Mark Allen Weiss是佛羅里達國際大學計算機與信息科學學院的教授和副主任。他目前還擔任本科學習和研究生學習的主任。他於1983年從庫珀聯盟大學獲得電機工程學士學位，並於1987年在普林斯頓大學獲得計算機科學博士學位，師從Bob Sedgewick。他在計算機科學領域有豐富的研究和教學經驗。