| 1 | initial version |
L = []
def find_root_recursive(func,a,b,tol=0.000000000001):
global L
try:
x0 = find_root(func,a,b)
L.append(x0)
find_root_recursive(func,a,x0-tol)
find_root_recursive(func,x0+tol,b)
except:
pass
find_root_recursive(sin,-50,50)
L.sort()
L
| 2 | No.2 Revision |
| 3 | No.3 Revision |
L = []
def find_root_recursive(func,a,b,tol=0.000000000001):
global L
try:
x0 = find_root(func,a,b)
L.append(x0)
find_root_recursive(func,a,x0-tol) | 4 | No.4 Revision |
L = []
def find_root_recursive(func,a,b,tol=0.000000000001):
global L
L = []
try:
x0 = find_root(func,a,b)
L.append(x0)
L += find_root_recursive(func,a,x0-tol)
L += find_root_recursive(func,x0+tol,b)
except:
pass
return L
L = find_root_recursive(sin,-50,50)
L.sort()
L
| 5 | No.5 Revision |
def find_root_recursive(func,a,b,tol=0.000000000001):
L = []
try:
x0 = find_root(func,a,b)
L.append(x0)
L += find_root_recursive(func,a,x0-tol)
L += find_root_recursive(func,x0+tol,b)
except:
pass
return L
L = find_root_recursive(sin,-50,50)
L.sort()
L
| 6 | No.6 Revision |
def find_root_recursive(func,a,b,tol=0.000000000001):
L = []
try:
x0 = find_root(func,a,b)
L.append(x0)
L += find_root_recursive(func,a,x0-tol) find_root_recursive(func,a,x0-tol,tol)
L += find_root_recursive(func,x0+tol,b) find_root_recursive(func,x0+tol,b,tol)
except:
pass
return L
L = find_root_recursive(sin,-50,50)
L.sort()
L
| 7 | No.7 Revision |
L = find_root_recursive(sin,-50,50)
L.sort()
L
| 8 | No.8 Revision |
def find_root_recursive(func,a,b,tol=0.000000000001):
L = []
try:
x0 = find_root(func,a,b)
L.append(x0)
L += find_root_recursive(func,a,x0-tol,tol)
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.