1、算法步骤:
def minimun(a,b):
while(b-a>e-10):
x=a+(b-a)/float(3)
y=a+2*(b-a)/float(3)
if function(x)>function(y):
a=x
else:
b=y
return function(a)

2、函数为:
def function(x):
return math.pow(x,3)+5

3、结果如图所示:


1、算法步骤:
def minimun(a,b):
while(b-a>e-10):
x=a+(b-a)/float(3)
y=a+2*(b-a)/float(3)
if function(x)>function(y):
a=x
else:
b=y
return function(a)

2、函数为:
def function(x):
return math.pow(x,3)+5

3、结果如图所示:

