Data Structures and Algorithm Analysis in Java, 3/e (IE-Paperback)
暫譯: Java中的資料結構與演算法分析（第三版）

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完全性等主題，並專門 dedicates 一整章來討論攤銷分析和進階資料結構及其實作。圖示和範例展示了演算法的各個階段，增強了Weiss對每種類型演算法的細緻、嚴謹和深入的分析。主題的邏輯組織和完整的原始碼存取補充了文本的內容。

<章節目錄>

Ch1: 介紹
Ch2: 演算法分析
Ch3: 列表、堆疊與佇列
Ch4: 樹
Ch5: 雜湊
Ch6: 優先佇列（堆）
Ch7: 排序
Ch8: 不相交集合類別
Ch9: 圖演算法
Ch10: 演算法設計技術
Ch11: 攤銷分析
Ch12: 進階資料結構與實作

類似商品