Scheme_2_Efficiency

Scheme_2_Efficiency

ID:40101175

大小:81.12 KB

页数:4页

时间:2019-07-21

Scheme_2_Efficiency_第1页
Scheme_2_Efficiency_第2页
Scheme_2_Efficiency_第3页
Scheme_2_Efficiency_第4页
资源描述:

《Scheme_2_Efficiency》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Lecturecontents•Inthislecturewewilllookat:•Theprocessesgeneratedbytheevaluationofrecursivedefinitions(A&S1.2)–“Iterative”vs“recursive”definitions.EfficiencyandFormulatingAbstractions–EfficiencywithHigherOrderProcedures•Formulatingabstractionswithhigher-or

2、derprocedures(A&S1.3)Abelson&Sussman&Sussman–proceduresasargumentssections:(firstpart)1.2&(firstpart)1.3–constructingproceduresusinglambda–proceduresasgeneralmethods–proceduresasreturnedvalues•WewilldefertheunderlinedtopicsuntilnextlectureAdvancedProgramm

3、ingParadigmsAdvancedProgrammingParadigms©2002TheUniversityofAdelaide/1.0IntroScheme-3/Slide1©2002TheUniversityofAdelaide/1.0IntroScheme-3/Slide2WhyunderstandingprocessisimportantExample:Factorial•Whenwritingaprogram,itisimportanttobeableto•Recursivedefini

4、tionscanhavedifferentefficiencies.visualisewhattheprogramwilldowhenitruns.•Considerthefollowingdefinitionoffactorial:•Withoutthisknowledgeyoucannottellifaprogramdoes(define(factorialn)whatyouwantittodo.(if(=n1)1–ordoesitsjobefficiently!(*n(factorial(-n1))

5、)))•Recursivedefinitionsdescribehowacomputationalprocess•Thisdefinitionmakesonerecursivecalltofactorialandthengetsfromonestagetothenext.multipliestheresultbyn.–Itdescribeslocalprocessing.•Thevalueofnmustberecordedsomewheresoweknow•You,astheprogrammer,need

6、tounderstandhowthesewhattomultiplybywhentherecursivecall:factorial(n-1)elementsoflocalprocessingarejoinedtogethertoformareturns.globalprocess.–Wemustalsorememberthatthenextthingwehavetodo,afterreturning,ismultiplication.AdvancedProgrammingParadigmsAdvance

7、dProgrammingParadigms©2002TheUniversityofAdelaide/1.0IntroScheme-3/Slide3©2002TheUniversityofAdelaide/1.0IntroScheme-3/Slide4Example:Factorial(cont’d)Amoreefficientfactorial•Sampleevaluation:•Amoreefficientversionoffactorial:(define(factorialn)(fact-iter1

8、1n))(define(fact-iterproductcountermax-count)(if(>countermax-count)product(fact-iter(*counterproduct)(+counter1)max-count)))•fact-iterdoesnotperformanycomputationaftertherecursivecall–Noextrainformationtoremember.–T

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

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

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