introduction to algorithms 2nd ed. - mit faculty

《introduction to algorithms 2nd ed. - mit faculty》由会员上传分享，免费在线阅读，更多相关内容在学术论文-天天文库。

1、IntroductiontoAlgorithms,SecondEditionThomasH.CormenCharlesE.LeisersonRonaldL.RivestCliffordSteinTheMITPressCambridge,MassachusettsLondon,EnglandMcGraw-HillBookCompanyBostonBurrRidge,ILDubuque,IAMadison,WINewYorkSanFranciscoSt.LouisMontréalTorontoThisbookiso

2、neofaseriesoftextswrittenbyfacultyoftheElectricalEngineeringandComputerScienceDepartmentattheMassachusettsInstituteofTechnology.ItwaseditedandproducedbyTheMITPressunderajointproduction-distributionagreementwiththeMcGraw-HillBookCompany.OrderingInformation:No

3、rthAmericaTextordersshouldbeaddressedtotheMcGraw-HillBookCompany.AllotherordersshouldbeaddressedtoTheMITPress.OutsideNorthAmericaAllordersshouldbeaddressedtoTheMITPressoritslocaldistributor.Copyright©2001byTheMassachusettsInstituteofTechnologyFirstedition199

4、0Allrightsreserved.Nopartofthisbookmaybereproducedinanyformorbyanyelectronicormechanicalmeans(includingphotocopying,recording,orinformationstorageandretrieval)withoutpermissioninwritingfromthepublisher.ThisbookwasprintedandboundintheUnitedStatesofAmerica.Lib

5、raryofCongressCataloging-in-PublicationDataIntroductiontoalgorithms/ThomasH.Cormen...[etal.].-2nded.p.cm.Includesbibliographicalreferencesandindex.ISBN0-262-03293-7(hc.:alk.paper,MITPress).-ISBN0-07-013151-1(McGraw-Hill)1.Computerprogramming.2.Computeralgori

6、thms.I.Title:Algorithms.II.Cormen,ThomasH.QA76.6I58582001005.1-dc212001031277PrefaceThisbookprovidesacomprehensiveintroductiontothemodernstudyofcomputeralgorithms.Itpresentsmanyalgorithmsandcoverstheminconsiderabledepth,yetmakestheirdesignandanalysisaccessib

7、letoalllevelsofreaders.Wehavetriedtokeepexplanationselementarywithoutsacrificingdepthofcoverageormathematicalrigor.Eachchapterpresentsanalgorithm,adesigntechnique,anapplicationarea,orarelatedtopic.AlgorithmsaredescribedinEnglishandina"pseudocode"designedtobe

8、readablebyanyonewhohasdonealittleprogramming.Thebookcontainsover230figuresillustratinghowthealgorithmswork.Sinceweemphasizeefficiencyasadesigncriterion,weincludecarefulanalysesoftherunningtimeso