Java算法

《Java算法》是2004年清華大學出版社出版的圖書，作者是塞奇威克。本書用Java語言全面實現了當今最重要的計算機算法，並用大量圖表和數學公式對算法進行了詳盡的描述和分析。

基本介紹

• 作者：塞奇威克
• 出版社：清華大學出版社
• 出版年：2004-06-01
• 頁數：552
• 裝幀：平裝

內容簡介

全書共分3卷，本書是其中的第1卷（第1至第4部分）。內容包括基本概念（第1部分）、數據結構（第2部分）、排序算法（第3部分）和查找算法（第4部分）。本書概念清楚，內容翔實，新穎，由淺入深地描述了算法。本書可作為高等院校計算機相關專業本科生和研究生的教材和補充讀物，也可作為Java愛好。

目錄

Fundamentals
Chapter1.Introduction
1.1Algorithms
1.2ASampleProblem:Connectivity
1.3Union-FindAlgorithms
1.4Perspective
1.5SummaryofTopics
Chapter2.PrinciplesofAlgorithmAnalysis
2.1ImplementationandEmpiricalAnalysis
2.2AnalysisofAlgorithms
2.3GrowthofFunctions
2.4Big-OhNotation
2.5BasicRecurrences
2.6ExamplesofAlgorithmAnalysis
2.7Guarantees,Predictions,andLimitations
DataStructures
Chapter3.ElementaryDataStructures
3.1BuildingBlocks
3.2Arrays
3.3LinkedLists
3.4ElementaryListProcessing
3.5MemoryAllocationforLists
3.6Strings
3.7CompoundDataStructures
Chapter4.AbstractDataTypes
4.1CollectionsofItems
4.2PushdownStackADT
4.3ExamplesofStackADTClients
4.4StackADTImplementations
4.5GenericImplementations
4.6CreationofaNewADT
4.7FIFOQueuesandGeneralizedQueues
4.8DuplicateandIndexItems
4.9First-ClassADTs
4.10Application-BasedADTExample
4.11Perspective
Chapter5.RecursionandTrees
5.1RecursiveAlgorithms
5.2DivideandConquer
5.3DynamicProgramming
5.4Trees
5.5MathematicalPropertiesofTrees
5.6TreeTraversal
5.7RecursiveBinary-TreeAlgorithms
5.8GraphTraversal
5.9Perspective
Sorting
Chapter6.ElementarySortingMethods
6.1RulesoftheGame
6.2GenericSortImplementations
6.3SelectionSort
6.4InsertionSort
6.5Bubblesort
6.6PerformanceCharacteristicsofElementary-Sorts
6.7AlgorithmVisualization
6.8Shellsort
6.9SortingLinkedLists
6.10Key-IndexedCounting
Chapter7.Quicksort
7.1TheBasicAlgorithm
7.2PerformanceCharacteristicsofQuicksort
7.3StackSize
7.4SmallSubfiles
7.5Median-of-ThreePartitioning
7.6DuplicateKeys
7.7StringsandVectors
7.8Selection
Chapter8.MergingandMergesort
8.1Two-WayMerging
8.2AbstractIn-PlaceMerge
8.3Top-DownMergesort
8.4ImprovementstotheBasicAlgorithm
8.5Bottom-UpMergesort
8.6PerformanceCharacteristicsofMergesort
8.7Linked-ListImplementationsofMergesort
8.8RecursionRevisited
Chapter9.PriorityQueuesandHeapsort
9.1ElementaryImplementations
9.2HeapDataStructure
9.3AlgorithmsonHeaps
9.4Heapsort
9.5Priority-QueueADT
9.6PriorityQueuesforClientArrays
9.7BinomialQueues
Chapter1O.RadixSorting
10.1Bits,Bytes,andWords
10.2BinaryQuicksort
10.3MSDRadixSort
10.4Three-WayRadixQuicksort
10.5LSDRadixSort
10.6PerformanceCharacteristicsofRadixSorts
10.7Sublinear-TimeSorts
Chapter11.Special-PurposeSortingMethods
11.1Batcher'sOdd-EvenMergesort
11.2SortingNetworks
11.3SortingInPlace
11.4ExternalSorting
11.5Sort-MergeImplementations
11.6ParallelSort-Merge
Searching
Chapter12.SymbolTablesandBSTs
12.1Symbol-TableAbstractDataType
12.2Key-IndexedSearch
12.3SequentialSearch
12.4BinarySearch
12.5IndexImplementationswithSymbolTables
12.6BinarySearchTrees
12.7PerformanceCharacteristicsofBSTs
12.8InsertionattheRootinBSTs
12.9BSTImplementationsofOtherADTOperations
Chapter13.BalancedTrees
13.1RandomizedBSTs
13.2SplayBSTs
13.3Top-Down2-3-4Trees
13.4Red-BlackTrees
13.5SkipLists
13.6PerformanceCharacteristics
Chapter14.Hashing
14.1HashFunctions
14.2SeparateChaining
14.3LinearProbing
14.4DoubleHashing
14.5DynamicHashTables
14.6Perspective
Chapter15.RadixSearch
15.1DigitalSearchTrees
15.2Tries
15.3PatriciaTries
15.4MultiwayTriesandTSTs
15.5Text-String-IndexApplications