Data Structures with C++ using STL Chapter 151

Data Structures with C++ using STL Chapter 151

ID:44251897

大小:441.50 KB

页数:29页

时间:2019-10-20

Data Structures with C++ using STL Chapter 151_第1页
Data Structures with C++ using STL Chapter 151_第2页
Data Structures with C++ using STL Chapter 151_第3页
Data Structures with C++ using STL Chapter 151_第4页
Data Structures with C++ using STL Chapter 151_第5页
资源描述:

《Data Structures with C++ using STL Chapter 151》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库

1、1MainIndexContentsBuildingaRuler:drawRuler()MergeAlgorithmExample(4slides)PartitioningandMergingofSublistsinmergeSort()FunctioncallsinmergeSort()QuicksortExample(8slides)Findingkth–LargestElementpowerSet()ExampleChapter15–AdvancedRecursiveAlgorithmsRecursivecallsforfib(5)Ef

2、fectoffib(5)UsingDynamicProgrammingThe8-QueensExample(3slides)SummarySlides(6slides)12MainIndexContents2MainIndexContentsBuildingaRuler:drawRuler()Problem:createaprogramthatdrawsmarksatregularintervalsonaline.Thesizesofthemarksdiffer,dependingonthespecificinterval.-Therecur

3、sivefunctiondrawRuler()assumestheexistenceofthefunctiondrawMark(),whichtakesapointxandanintegervaluehasargumentsanddrawsamarkatpointxwithsizeproportionaltoh.2TheMergeAlgorithmExampleThemergealgorithmtakesasequenceofelementsinavectorvhavingindexrange[first,last).Thesequencec

4、onsistsoftwoorderedsublistsseparatedbyanintermediateindex,calledmid.34MainIndexContentsTheMergeAlgorithm…(Cont…)45MainIndexContentsTheMergeAlgorithm…(Cont…)5TheMergeAlgorithm…(Cont…)67MainIndexContentsPartitioningandMergingofSublistsinmergeSort()7FunctioncallsinmergeSort()8

5、QuicksortExampleThequicksortalgorithmusesaseriesofrecursivecallstopartitionalistintosmallerandsmallersublistsaboutavaluecalledthepivot.Example:Letvbeavectorcontaining10integervalues:v={800,150,300,650,550,500,400,350,450,900}9QuicksortExample(Cont…)1011MainIndexContentsQuic

6、ksortExample(Cont…)11QuicksortExample(Cont…)12QuicksortExample(Cont…)13QuicksortExample(Cont…)14QuicksortExample(Cont…)1516MainIndexContentsQuicksortExample(Cont…)16FindingKth–LargestElementTolocatethepositionofthekth-largestvalue(kLargest)inthelist,partitiontheelementsinto

7、twodisjointsublists.ThelowersublistmustcontainkelementsthatarelessthanorequaltokLargestandtheuppersublistmustcontainelementsthataregreaterthanorequaltokLargest.TheelementsinthelowersublistdonotneedtobeorderedbutonlytohavevaluesthatarelessthanorequaltokLargest.Theoppositecon

8、ditionappliestotheuppersublist.1718MainIndexContentspowerSet()Example18Recursiveca

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。