成功加入购物车
[美] 科尔曼 (Cormen) 著 / 高等教育出版社 / 2002-01 / 平装
售价 ¥ 20.00 2.9折
定价 ¥68.00
品相 八五品
上书时间2021-12-08
算法导论
本书自第一版出版以来,已经成为世界范围内广泛使用的大学教材和专业人员的标准参考手册。本书全面论述了算法的内容,从一定深度上涵盖了算法的诸多方面,同时其讲授和分析方法又兼顾了各个层次读者的接受能力。各章内容自成体系,可作为独立单元学习。所有算法都用英文和伪码描述,使具备初步编程经验的人也可读懂。全书讲解通俗易懂,且不失深度和数学上的严谨性。第二版增加了新的章节,如算法作用、概率分析与随机算法、线性编程等,几乎对第一版的各个部分都作了大量修订。
ThomasdH.Cormen是达特茅斯学院计算机科学系副教授,CharlesE.Leiserson是麻省理工学院计算机科学与电气工程系教授,RonaldL.Rivest是麻省理工学院计算机科学系教授,CliffordStein是哥伦比亚大学工程与运营研究所副教授。
目录IFoundationsIntroduction3lTheRoleofAlgorithmsinComputing5l.lAlgorithms5l.2Algorithmsasatechnology102GettingStartedI52.lInsertionsort152.2Analyzingalgorithms212.3Designingalgorithms273GrowthofFunctions413.lAsymptoticnotation413.2Standardnotationsandcommonfunctions514Recurrences624.lThesubstitutionmethod634.2Therecursion-treemethod674.3Themastermethod734.4Proofofthemastertheorem765ProbabilisticAnalysisandRandomizedAlgorithms5.lThehiringproblem915.2Indicatorrandomvariables945.3Randomizedalgorithms995.4Probabi1isticanalysisandfurtherusesofindicator106IISortingandOrderStatisticsIntroduction1236Heapsort1276.lHeapsI276.2Maintainingtheheapproperty1306.3Buildingaheap1326.4Theheapsortalgorithm1356.5Priorityqueues1387Quicksort1457.lDescriptionofquicksort1457.2Performanceofquicksort1497.3Arandomizedversionofquicksort1537.4Analysisofquicksort558SortinginLinearTime1658.lLowerboundsforsorting1658.2Countingsorti688.3Radixsort1708.4Bucketsort1749MediansandOrderStatistics1839.1Minimumandmaximum1849.2Selectioninexpectedlineartime1859.3Selectioninworst-caselineartime189IIIDataStructuresIntroduction19710ElementaryDataStructures200l0.lStacksandqueues200l0.2Linkedlists204l0.3Implementingpointersandobjects209l0.4Representingrootedtrees21411HashTables221ll.lDirect-addresstables22211.2Hashtables224ll.3Hashfunctions229ll.4Openaddressing237ll.5Perfecthashing24Sl2BinarySearchTrees253l2.lWhatisabinarysearchtree?2S3l2.2Queryingabinarysearchtree2S6l2.3Insertionanddeletion261l2.4Randoinlybuiltbinarysearchtrees26513Red-BlackThees273l3.lPropertiesofred-blacktrees273l3.2Rotations277l3.3Insertion280l3.4Deletion28814AugmentingDataStructures302l4.lDynamicorderstatistics302l4.2Howtoaugmentadatastructure308l4.3Intervaltrees311IVAdvancedDestheandAnalysisTechniquesIntroduction32115DynamicProgrammingJ2Jl5.lAssembly--linescheduling324l5.2Matrix-chainmultiplication331l5.3Elementsofdynamicprogramming33915.4Longestcommonsubsequence350l5.5Optimalbinarysearchtrees356l6GreedyAlgorithms370l6.lAnactivity-selectionproblem371l6.2Elementsofthegreedystrategy379l6.3Huffmancodes385l6.4Theoreticalfoundationsforgreedymethods39316.5Atask-schedulingproblem39917AmortizedAnalysis405l7.1Aggregateanalysis40617.2Theaccountingmethod41017.3Thepotentialmethod412l7.4Dynamictables416VAdvancedDataStructuresIntroduction43118B-Trees43418.lDefinitionofB--trees438l8.2BasicoperationsonB-trees44jl8.3DeletingakeyfromaB--tree44919BinomialHeaps455l9.lBinomialtreesandbinomialheaps45719.2Operationsonbinomialheaps46120FibonacciHeaps47620.lStructureofFibonacciheaps47720.2Mergeable-heapoperations47920.3Decreasingakeyanddeletinganode48920.4Boundingthemaximumdegree49321DataStructuresforDisjointSets4982l.lDisjoint--setoperations4982l.2Linked-listrepresentationofdisjointsets5012l.3Disjoint--setforests5052l.4Analysisofunionbyrankwithpathcompression50VIGraphAlgorithmsIntroduction52522ElementaryGraphAlgorithms52722.lRepresentationsofgraphs52722.2Breadth-firstsearch53122.3Depth-firstsearch54022.4Topologicalsort54922.5Stronglyconnectedcomponents55223MinimumSpanningTrees56123.lGrowingaminimumspanningtree56223.2Theal
展开全部
配送说明
...
相似商品
为你推荐
开播时间:09月02日 10:30