[2018年最新整理]VF算法总结.docVIP

/助你专升本 1．递推算法（常用级数、数列求和、二分法、梯形积分法、穷举法等）； * 1+1/2+1/3+1/4+...+1/n clear input 请输入n的值:N= to n s=0 for i=1 to n s=s+1/i endfor ?S * 1 1 2 3 5 8 13..... clear input 请输入n的值:N= to n dimension a[n] a[1]=1 a[2]=1 s=2 for i=3 to n a[i]=a[i-1]+a[i-2] s=s+a[i] endfor ?S *二分法解方程3x*x*x-4x*x+3x-6=0要求误差小于十的负六次方 clear input x1= to x1 input x2= to x2 fx1=x1*((3*x1-4)*x1+3)-6 fx2=x2*((3*x2-4)*x2+3)-6 do while fx1*fx2 0 input x1= to x1 input x2= to x2 fx1=x1*((3*x1-4)*x1+3)-6 fx2=x2*((3*x2-4)*x2+3)-6 enddo x0=(x1+x2)/2 fx0=x0*((3*x0-4)*x0+3)-6 do while abs(fx0)=0.000001 x0=(x1+x2)/2 fx1=x1*((3*x1-4)*x1+3)-6 fx0=x0*((3*x0-4)*x0+3)-6 if((fx0*fx1)0) x2=x0 else x1=x0 endif enddo ? x0 *梯形积分法求函数f=x*x-5x在区间[a,b]上的积分* clear ? txjf(1,10,10000) function txjf parameters a,b,n h=(b-a)/n s=0 for i=1 to n fa=f(a+i*h) fb=f(a+(i+1)*h) s=s+(fa+fb)*h/2 endfor return s function f parameter x return x*x-5*x 现有面值为l元、2元和5元的钞票(假设每种钞票的数量都足够多)，从这些 钞票中取出30张使其总面值为100元，问有多少种取法?输出每种取法中各种面额钞票的张数。 clear for i=1 to 30 for j=1 to 30 for k=1 to 20 if i+j+k=30 and i+2*j+5*k=100 ? 1元的+str(i)+张 +2元的+str(j)+张 +5元的+str(k)+张 endif endfor endfor Endfor 2．排序算法（选择法、冒泡法）； clear input N= to n dimension a[n] for i=1 to n input a[+str(i,2,1)+]= to a[i] endfor for i=1 to n-1 p=i for j=i+1 to n If a[j]a[i] p = j EndIf endfor if pi temp=a[i] a[i]=a[p] a[p]=temp endif endfor for i=1 to n ?? a[i] endfor clear input 请输入n的值:N= to n dimension a[n] for i=1 to n input 请输入第+str(i)+个数：to a[i] endfor for i=1 to n-1 for j=1 to n-i if a[i]a[j] temp=a[i] a[i]=a[j] a[j]=temp endif endfor endfor for i=1 to n ?a[i] endfor 3．查找算法（顺序查找、折半查找）； clear input N= to n dimension a[n] for i=1 to n input a[+str(i,2,1)+]= to a[i] endfor input 请输入要查找的数findnum= to findnum for i=1 to n if a[i]=findnum exit endif endfor if in ? not found else ? find endif clear input 请输入n的值:N= to n dimension a[n] for i=1 to n input 请输入第+str(i)+个数：to a[i] endfor for i=1 to n for j=i+1 to n if a[i]a[j] temp=a[i] a[i]=a[j] a[j]=temp endif endfor endfor start=1 iend=n input 输