基础算法递推法(Recursive algorithm)

基础算法递推法(Recursive algorithm)

ID:42440169

大小:51.00 KB

页数:18页

时间:2019-09-15

基础算法递推法(Recursive algorithm)_第1页
基础算法递推法(Recursive algorithm)_第2页
基础算法递推法(Recursive algorithm)_第3页
基础算法递推法(Recursive algorithm)_第4页
基础算法递推法(Recursive algorithm)_第5页
资源描述:

《基础算法递推法(Recursive algorithm)》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、基础算法-递推法(Recursivealgorithm)Thereisaclassofquestions,thechangesbetweeneverytwoadjacentitemshaveacertainregularity,wecanputthisruleintosimplerecursiveformulaasfollows:Fn=g(Fn-1)Thisisthenumberinthesequence,establishtherelationshipbetweentheantecedentandconsequent,thenfromtheini

2、tialcondition(orend)tostart,stepbystepaccordingtotherecursiverelationofrecursion,untilthefinalresultsobtained(orinitialvalue).Manyprogramsaresolvedinthisway.Ifatest,ifwecanfindarelationshipbeforeandafteraclearanditsinitialcondition(endresult),liketosolvetheproblem,letthecomput

3、ercalculationisastepbystep,letthecomputerdothehigh-speedrepetitiveoperation,canreallyplaythe"bestuse"effect.Recursive,backwardpushandpushtwoforms.Generalanalysisidea:IfsolvingconditionF1Thenbegin{inverted}Theproblem(orrecursiverelation)todeterminethefinalresultofFa;Forinverted

4、formulaFi-1=g'(Fi);I=n{{start}fromthefinalresultFnWhilecurrentresultsFinoninitialvaluesF1doareinvertedbyFi-1=g(F1);OutputpushbackresultsF1andpushbackwardprocess;End{then}Else,begin{,push,}Theproblem(orforwardrelationship)todeterminetheinitialvalueofF1(boundaryconditions);Findt

5、heforwardrelationformulaF1=g(Fi-1);I=1;{proceedfromtheboundaryconditionF1{}}TheresultsofFiwhiledoFnnonfinalresultsbyFi=g(Fi-1)CISpushback;TheoutputoftheFnresultsandthepushingprocess;End;{else}I.backwardpushingmethodThepushdownmethod,isnotintheinitialvalueofthecase,bysomerecurs

6、iverelationsandinformedthesolutionoftheproblemorgoal,andthenpushdownover,inferitsinitialconditions.Becausetheoperationsofsuchproblemsaremappedonebyone,therecurrenceformulacanbeanalyzed.Then,fromthissolutionorgoal,takethepushbacksection,stepbystepintotheinitialstatementofthepro

7、blem.Herearesomeexamples.[1]oilstoragepointAheavytruckwantstocross1000kilometersofdesert,andthetruckuses1liters/kmoffuel,andthetotalcapacityofthetruckis500liters.Obviously,atrucknevergetsthroughthedesertatonetime.Asaresult,driversmusttrytosetupseveralstoragepointsalongthewayso

8、thattruckscancrossthedesertsmoothly.Howcandriversbuildtheseoi

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

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

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