JAVA算法(影印版第3版第1卷)/算法经典丛书

出版时间：2003-03-01  出版社：清华大学出版社  作者：RobertSedgewick  页数：737  
Tag标签：无  

内容概要

全书共分3卷，本书是其中的第1卷。内容包括基本概念、数据结构、排序算法和查找算法。本书概念清楚，内容翔实、新颖。以Java语言作为算法描述语言，易于理解、便于应用。

书籍目录

目 录FundamentalsChapter1.Introduction1.1Algorithms1.2ASampleProblem：Connectivity1.3Union-FindAlgorithms1.4Perspective1.5SummaryofTopicsChapter2.PrinciplesofAlgorithmAnalysis2.1ImplementationandEmpiricalAnalysis2.2AnalysisofAlgorithms2.3GrowthofFunctions2.4Big-OhNotation2.5BasicRecurrences2.6ExamplesofAlgorithmAnalysis2.7Guarantees，Predictions，andLimitationsDataStructuresChapter3.ElementaryDataStructures3.1BuildingBlocks3.2Arrays3.3LinkedLists3.4ElementaryListProcessing3.5MemoryAllocationforLists3.6Strings3.7CompoundDataStructuresChapter4.AbstractDataTypes4.1CollectionsofItems4.2PushdownStackADT4.3ExamplesofStackADTClients4.4StackADTImplementations4.5GenericImplementations4.6CreationofaNewADT4.7FIFOQueuesandGeneralizedQueues4.8DuplicateandIndexItems4.9First-ClassADTs4.10Application-BasedADTExample4.11PerspectiveChapter5.RecursionandTrees5.1RecursiveAlgorithms5.2DivideandConquer5.3DynamicProgramming5.4Trees5.5MathematicalPropertiesofTrees5.6TreeTraversal5.7RecursiveBinary-TreeAlgorithms5.8GraphTraversal5.9PerspectiveSortingChapter6.ElementarySortingMethods6.1RulesoftheGame6.2GenericSortImplementations6.3SelectionSort6.4InsertionSort6.5Bubblesort6.6PerformanceCharacteristicsofElementary-Sorts6.7AlgorithmVisualization6.8Shellsort6.9SortingLinkedLists6.10Key-IndexedCountingChapter7.Quicksort7.1TheBasicAlgorithm7.2PerformanceCharacteristicsofQuicksort7.3StackSize7.4SmallSubfiles7.5Median-of-ThreePartitioning7.6DuplicateKeys7.7StringsandVectors7.8SelectionChapter8.MergingandMergesort8.1Two-WayMerging8.2AbstractIn-PlaceMerge8.3Top-DownMergesort8.4ImprovementstotheBasicAlgorithm8.5Bottom-UpMergesort8.6PerformanceCharacteristicsofMergesort8.7Linked-ListImplementationsofMergesort8.8RecursionRevisitedChapter9.PriorityQueuesandHeapsort9.1ElementaryImplementations9.2HeapDataStructure9.3AlgorithmsonHeaps9.4Heapsort9.5Priority-QueueADT9.6PriorityQueuesforClientArrays9.7BinomialQueuesChapter1O.RadixSorting10.1Bits，Bytes，andWords10.2BinaryQuicksort10.3MSDRadixSort10.4Three-WayRadixQuicksort10.5LSDRadixSort10.6PerformanceCharacteristicsofRadixSorts10.7Sublinear-TimeSortsChapter11.Special-PurposeSortingMethods11.1BatchersOdd-EvenMergesort11.2SortingNetworks11.3SortingInPlace11.4ExternalSorting11.5Sort-MergeImplementations11.6ParallelSort-MergeSearchingChapter12.SymbolTablesandBSTs12.1Symbol-TableAbstractDataType12.2Key-IndexedSearch12.3SequentialSearch12.4BinarySearch12.5IndexImplementationswithSymbolTables12.6BinarySearchTrees12.7PerformanceCharacteristicsofBSTs12.8InsertionattheRootinBSTs12.9BSTImplementationsofOtherADTOperationsChapter13.BalancedTrees13.1RandomizedBSTs13.2SplayBSTs13.3Top-Down2-3-4Trees13.4Red-BlackTrees13.5SkipLists13.6PerformanceCharacteristicsChapter14.Hashing14.1HashFunctions14.2SeparateChaining14.3LinearProbing14.4DoubleHashing14.5DynamicHashTables14.6PerspectiveChapter15.RadixSearch15.1DigitalSearchTrees15.2Tries15.3PatriciaTries15.4MultiwayTriesandTSTs15.5Text-String-IndexApplications