mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-01 00:41:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #233 from ashu01/master

Browse Source 
typo fix
This commit is contained in:
Harshil 2017-12-30 15:05:16 +05:30 committed by GitHub
commit a033150426
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Bisection.py
View File

@ -9,13 +9,13 @@ def bisection(function, a, b): # finds where the function becomes 0 in [a,b] us
return a
elif function(b) == 0:
return b
elif function(a) * function(b) > 0: # if noone of these are root and they are both possitive or negative,
# then his algorith can't find the root
elif function(a) * function(b) > 0: # if none of these are root and they are both positive or negative,
# then his algorithm can't find the root
print("couldn't find root in [a,b]")
return
else:
mid = (start + end) / 2
while abs(start - mid) > 0.0000001: # untill we achive percise equals to 10^-7
while abs(start - mid) > 0.0000001: # until we achieve precise equals to 10^-7
if function(mid) == 0:
return mid
elif function(mid) * function(start) < 0:
@ -27,7 +27,7 @@ def bisection(function, a, b): # finds where the function becomes 0 in [a,b] us
def f(x):
return math.pow(x, 3) - 2*x -5
return math.pow(x, 3) - 2*x - 5
print(bisection(f, 1, 1000))