《算法設計與分析基礎（第3版影印版）》是2013年5月8日清華大學出版社出版的圖書，作者是(美)Anany Levitin 。
圖書詳細信息,圖書簡介,目錄,
圖書詳細信息
ISBN：9787302311850
定價：79元
印次：1-1
裝幀：平裝
印刷日期：2013-5-8
圖書簡介
《算法設計與分析基礎 （第3版）（影印版）》在講述算法設計技術時採用了新的分類方法，在討論分析方法時條分縷析，形成了連貫有序、耳目一新的風格。為便於學生掌握，本書涵蓋算法入門課程的全部內容，更注重對概念(而非形式)的理解。書中通過一些流行的謎題來激發學生的興趣，幫助他們加強和提高解決算法問題的能力。每章小結、習題提示和詳細解答，形成了非常鮮明的教學特色。
目錄
TableofContents
NewtotheThirdEditionxvii
Prefacexix
1Introduction
1.1WhatIsanAlgorithm?
Exercises1.1
1.2FundamentalsofAlgorithmicProblemSolving
UnderstandingtheProblem
AscertainingtheCapabilitiesoftheComputationalDevice
ChoosingbetweenExactandApproximateProblemSolving
AlgorithmDesignTechniques
DesigninganAlgorithmandDataStructures
MethodsofSpecifyinganAlgorithm
ProvinganAlgorithm’sCorrectness
AnalyzinganAlgorithm
CodinganAlgorithm
Exercises1.2
1.3ImportantProblemTypes
Sorting
Searching
StringProcessing
GraphProblems
CombinatorialProblems
GeometricProblems
NumericalProblems
Exercises1.3
1.4FundamentalDataStructures
LinearDataStructures
Graphs
Trees
SetsandDictionaries
Exercises1.4
Summary
2FundamentalsoftheAnalysisofAlgorithmEfficiency
2.1TheAnalysisFramework
MeasuringanInput’sSize
UnitsforMeasuringRunningTime
OrdersofGrowth
Worst-Case,Best-Case,andAverage-CaseEfficiencies
RecapitulationoftheAnalysisFramework
Exercises2.1
2.2AsymptoticNotationsandBasicEfficiencyClasses
InformalIntroduction
O-notation
-notation
-notation
UsefulPropertyInvolvingtheAsymptoticNotations
UsingLimitsforComparingOrdersofGrowth
BasicEfficiencyClasses
Exercises2.2
2.3MathematicalAnalysisofNonrecursiveAlgorithms
Exercises2.3
2.4MathematicalAnalysisofRecursiveAlgorithms
Exercises2.4
2.5Example:ComputingthenthFibonacciNumber
Exercises2.5
2.6EmpiricalAnalysisofAlgorithms
Exercises2.6
2.7AlgorithmVisualization
Summary
3BruteForceandExhaustiveSearch
3.1SelectionSortandBubbleSort
SelectionSort
BubbleSort
Exercises3.1
3.2SequentialSearchandBrute-ForceStringMatching
SequentialSearch
Brute-ForceStringMatching
Exercises3.2
3.3Closest-PairandConvex-HullProblemsbyBruteForce
Closest-PairProblem
Convex-HullProblem
Exercises3.3
3.4ExhaustiveSearch
TravelingSalesmanProblem
KnapsackProblem
AssignmentProblem
Exercises3.4
3.5Depth-FirstSearchandBreadth-FirstSearch
Depth-FirstSearch
Breadth-FirstSearch
Exercises3.5
Summary
4Decrease-and-Conquer
4.1InsertionSort
Exercises4.1
4.2TopologicalSorting
Exercises4.2
4.3AlgorithmsforGeneratingCombinatorialObjects
GeneratingPermutations
GeneratingSubsets
Exercises4.3
4.4Decrease-by-a-Constant-FactorAlgorithms
BinarySearch
Fake-CoinProblem
RussianPeasantMultiplication
JosephusProblem
Exercises4.4
4.5Variable-Size-DecreaseAlgorithms
ComputingaMedianandtheSelectionProblem
InterpolationSearch
SearchingandInsertioninaBinarySearchTree
TheGameofNim
Exercises4.5
Summary
5Divide-and-Conquer
5.1Mergesort
Exercises5.1
5.2Quicksort
Exercises5.2
5.3BinaryTreeTraversalsandRelatedProperties
Exercises5.3
5.4MultiplicationofLargeIntegersand
Strassen’sMatrixMultiplication
MultiplicationofLargeIntegers
Strassen’sMatrixMultiplication
Exercises5.4
5.5TheClosest-PairandConvex-HullProblems
byDivide-and-Conquer
TheClosest-PairProblem
Convex-HullProblem
Exercises5.5
Summary
6Transform-and-Conquer
6.1Presorting
Exercises6.1
6.2GaussianElimination
LUDecomposition
ComputingaMatrixInverse
ComputingaDeterminant
Exercises6.2
6.3BalancedSearchTrees
AVLTrees
2-3Trees
Exercises6.3
6.4HeapsandHeapsort
NotionoftheHeap
Heapsort
Exercises6.4
