国外计算机科学教材系列：数据结构与算法分析（C++版）（第3版）（英文版）

图书标准信息

• 作者 [美]Clifford A.Shaffer 著
• 出版社 电子工业出版社
• 出版时间 2013-01
• 版次 3
• ISBN 9787121192609
• 定价 69.00元
• 装帧 平装
• 开本 16开
• 纸张 胶版纸
• 页数 612页
• 字数 1273千字
• 正文语种 英语
• 丛书 国外计算机科学教材系列

【内容简介】

　　《国外计算机科学教材系列：数据结构与算法分析（C++版）（第3版）（英文版）》采用程序员最爱用的面向对象C++语言来描述数据结构和算法，并把数据结构原理和算法分析技术有机地结合在一起，系统介绍了各种类型的数据结构和排序、检索的各种方法。作者非常注意对每一种数据结构的不同存储方法及有关算法进行分析比较。书中还引入了一些比较高级的数据结构与先进的算法分析技术，并介绍了可计算性理论的一般知识。本版的重要改进在于引入了参数化的模板，从而提高了算法中数据类型的通用性，支持高效的代码重用。

【目录】

Preface
PartIPreliminaries
Chapter1DataStructuresandAlgorithms
1.1APhilosophyofDataStructures
1.1.1TheNeedforDataStructures
1.1.2CostsandBenefits
1.2AbstractDataTypesandDataStructures
1.3DesignPatterns
1.3.1Flyweight
1.3.2Visitor
1.3.3Composite
1.3.4Strategy
1.4Problems，Algorithms，andPrograms
1.5FurtherReading
1.6Exercises

Chapter2MathematicalPreliminaries
2.1SetsandRelations
2.2MiscellaneousNotation
2.3Logarithms
2.4SummationsandRecurrences
2.5Recursion
2.6MathematicalProofTechniques
2.6.1DirectProof
2.6.2ProofbyContradiction
2.6.3ProofbyMathematicalInduction
2.7Estimation
2.8FurtherReading
2.9Exercises

Chapter3AlgorithmAnalysis
3.1Introduction
3.2Best，Worst，andAverageCases
3.3AFasterComputer，oraFasterAlgorithm？
3.4AsymptoticAnalysis
3.4.1UpperBounds
3.4.2LowerBounds
3.4.3Notation
3.4.4SimplifyingRules
3.4.5ClassifyingFunctions
3.5CalculatingtheRunningTimeforaProgram
3.6AnalyzingProblems
3.7CommonMisunderstandings
3.8MultipleParameters
3.9SpaceBounds
3.10SpeedingUpYourPrograms
3.11EmpiricalAnalysis
3.12FurtherReading
3.13Exercises
3.14Projects

PartIIFundamentalDataStructures
Chapter4Lists，Stacks，andQueues
4.1Lists
4.1.1Array-BasedListImplementation
4.1.2LinkedLists
4.1.3ComparisonofListImplementations
4.1.4ElementImplementations
4.1.5DoublyLinkedLists
4.2Stacks
4.2.1Array-BasedStacks
4.2.2LinkedStacks
4.2.3ComparisonofArray-BasedandLinkedStacks
4.2.4ImplementingRecursion
4.3Queues
4.3.1Array-BasedQueues
4.3.2LinkedQueues
4.3.3ComparisonofArray-BasedandLinkedQueues
4.4Dictionaries
4.5FurtherReading
4.6Exercises
4.7Projects

Chapter5BinaryTrees
5.1DefinitionsandProperties
5.1.1TheFullBinaryTreeTheorem
5.1.2ABinaryTreeNodeADT
5.2BinaryTreeTraversals
5.3BinaryTreeNodeImplementations
5.3.1Pointer-BasedNodeImplementations
5.3.2SpaceRequirements
5.3.3ArrayImplementationforCompleteBinaryTrees
5.4BinarySearchTrees
5.5HeapsandPriorityQueues
5.6HuffmanCodingTrees
5.6.1BuildingHuffmanCodingTrees
5.6.2AssigningandUsingHuffmanCodes
5.6.3SearchinHuffmanTrees
5.7FurtherReading
5.8Exercises
5.9Projects

Chapter6Non-BinaryTrees
6.1GeneralTreeDefinitionsandTerminology
6.1.1AnADTforGeneralTreeNodes
6.1.2GeneralTreeTraversals
6.2TheParentPointerImplementation
6.3GeneralTreeImplementations
6.3.1ListofChildren
6.3.2TheLeft-Child/Right-SiblingImplementation
6.3.3DynamicNodeImplementations
6.3.4Dynamic“Left-Child/Right-Sibling”Implementation
6.4K-aryTrees
6.5SequentialTreeImplementations
6.6FurtherReading
6.7Exercises
6.8Projects

PartIIISortingandSearching
Chapter7InternalSorting
7.1SortingTerminologyandNotation
7.2Three(n2)SortingAlgorithms
7.2.1InsertionSort
7.2.2BubbleSort
7.2.3SelectionSort
7.2.4TheCostofExchangeSorting
7.3Shellsort
7.4Mergesort
7.5Quicksort
7.6Heapsort
7.7BinsortandRadixSort
7.8AnEmpiricalComparisonofSortingAlgorithms
7.9LowerBoundsforSorting
7.10FurtherReading
7.11Exercises
7.12Projects

Chapter8FileProcessingandExternalSorting
8.1PrimaryversusSecondaryStorage
8.2DiskDrives
8.2.1DiskDriveArchitecture
8.2.2DiskAccessCosts
8.3BuffersandBufferPools
8.4TheProgrammer’sViewofFiles
8.5ExternalSorting
8.5.1SimpleApproachestoExternalSorting
8.5.2ReplacementSelection
8.5.3MultiwayMerging
8.6FurtherReading
8.7Exercises
8.8Projects

Chapter9Searching
9.1SearchingUnsortedandSortedArrays
9.2Self-OrganizingLists
9.3BitVectorsforRepresentingSets
9.4Hashing
9.4.1HashFunctions
9.4.2OpenHashing
9.4.3ClosedHashing
9.4.4AnalysisofClosedHashing
9.4.5Deletion
9.5FurtherReading
9.6Exercises
9.7Projects

Chapter10Indexing
10.1LinearIndexing
10.2ISAM
10.3Tree-basedIndexing
10.42-3Trees
10.5B-Trees
10.5.1B+-Trees
10.5.2B-TreeAnalysis
10.6FurtherReading
10.7Exercises
10.8Projects
……