經(jīng)典數(shù)據(jù)結(jié)構(gòu)

內(nèi)容概要

本書最大的特點(diǎn)是，首先定義了抽象數(shù)據(jù)類型（ADT），然后在此基礎(chǔ)上介紹了數(shù)據(jù)結(jié)構(gòu)的各種概念和知識(shí)。這樣，讀者的注意力不是放在數(shù)據(jù)結(jié)構(gòu)內(nèi)部的具體實(shí)現(xiàn)，而是集中于其外在功能接口與特性，使讀者可以在較短的時(shí)間內(nèi)學(xué)會(huì)如何使用Java語言本身提供的數(shù)據(jù)結(jié)構(gòu)。    本書的示例都只給出關(guān)鍵的語句而忽略細(xì)節(jié)部分，其源代碼可以從http://web.engr.oregonstate.edu/~budd/books/jds/下載，這不僅使得本書的結(jié)構(gòu)緊湊、可讀性強(qiáng)，而且可以避免讀者對(duì)本書的依賴，養(yǎng)成獨(dú)立思考、勤于動(dòng)手的習(xí)慣，有利于讀者對(duì)數(shù)據(jù)結(jié)構(gòu)知識(shí)的理解和掌握。    本書可以作為大中專院校的數(shù)據(jù)結(jié)構(gòu)教學(xué)用書。

書籍目錄

PREFACE XV1 THE MANAGEMENT OF COMPLEXITY   1.1 The Control of Complexity   1.2 Abstraction, Information Hiding, and Layering  1.3 Division into Parts   1.4 Composition   1.5 Layers of Specialization   1.6 Multiple Views   1.7 Patterns   1.8 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 2 ABSTRACT DATA TYPES   2.1 What Is a Type?   2.2 Abstract Data Types   2.3 The Fundamental ADTs   2.4 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 3 ALGORITHMS   3.1 Characteristics of Algorithms   3.2 Recipes as Algorithms   3.3 Analyzing Computer Algorithms   3.4 Recursive Algorithms   3.5 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 4 EXECUTION-TIME MEASUREMENT   4.1 Algorithmic Analysis and Big-Oh Notation   4.2 Execution Time of Programming Constructs   4.3 Summing Algorithmic Execution Times   4.4 The Importance of Fast Algorithms   4.5 Benchmarking Execution Times   4.6 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 5 INCREASING CONFIDENCE IN CORRECTNESS   5.1 Program Proofs   5.2 Program Testing   5.3 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 6 VECTORS   6.1 The Vector Data Structure   6.2 Enumeration   6.3 Application-Silly Sentences   6.4 Application-Memory Game   6.5 Application-Shell Sort   6.6 A Visual Vector   6.7 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 7 SORTING VECTORS   7.1 Divide and Conquer   7.2 SortedVectors   7.3 Merge Sort   7.4 Partitioning   7.5 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 8 LINKED LISTS   8.1 Varieties of Linked Lists   8.2 LISP-Style Lists   8.3 The LinkedList Abstraction   8.4 Application-Asteroids Game   8.5 Application-Infinite-Precision Integers   8.6 Chapter Summary   Further Information   Study Questions   Exercises   Programming Projects 9 LIST VARIATIONS ……10 STACKS 11 DEQUES 12. QuEuEs 13 TREES 14 BINARY SEARCH TREES 15 PRIORITY QUEUES 16 HASH TABLES 17 MAPS 18 SETS 19 MATRICES 20 GRAPHS APPENDIX A JAVA SYNTAX APPENDIX B IMPORT LIBRARIES APPENDIX C DATA STRUCTURES IN THE JAVA STANDARD LIBRARY BIBLIOGRAPHY INDEX

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    經(jīng)典數(shù)據(jù)結(jié)構(gòu) PDF格式下載

---