Data Structures and Algorithm Analysis in Java, 3/e (IE-Paperback)

Mark Allen Weiss

Data Structures and Algorithm Analysis in Java, 3/e (IE-Paperback)

買這商品的人也買了...

相關主題

商品描述

<內容簡介>

Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.

Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.


<章節目錄>

Ch1: Introduction
Ch2: Algorithm Analysis
Ch3: Lists, Stacks, and Queues
Ch4: Trees
Ch5: Hashing
Ch6: Priority Queues (Heaps)
Ch7: Sorting
Ch8: The Disjoint Set Class
Ch9: Graph Algorithms
Ch10: Algorithm Design Techniques
Ch11: Amortized Analysis
Ch12: Advanced Data Structures and Implementation

 

商品描述(中文翻譯)

《Java中的資料結構和演算法分析》是一本高級演算法書籍，適用於傳統CS2和演算法分析課程之間的課程。在舊的ACM課程指南中，這門課程被稱為CS7。它也適用於研究生的第一年演算法分析課程。

隨著電腦的速度和功率增加，對有效編程和演算法分析的需求也增加。Mark Allen Weiss通過同時學習這些技能，教讀者如何在Java中開發結構良好、效率最大的程式。

Weiss清楚地解釋了從二進制堆到排序到NP完全性的主題，並專門為攤銷分析和高級資料結構及其實現撰寫了一整章。圖片和例子展示了演算法的連續階段，有助於Weiss對每種演算法進行仔細、嚴謹和深入的分析。主題的邏輯組織和完整的源代碼訪問補充了本書的內容。

《Java中的資料結構和演算法分析》的章節目錄如下：
Ch1: 簡介
Ch2: 演算法分析
Ch3: 列表、堆疊和佇列
Ch4: 樹
Ch5: 雜湊
Ch6: 優先佇列（堆疊）
Ch7: 排序
Ch8: 不相交集合類
Ch9: 圖演算法
Ch10: 演算法設計技巧
Ch11: 攤銷分析
Ch12: 高級資料結構和實現

類似商品