Commitb7cff04

authored and

committed

better implementation for midpoint (#914)

1 parenta212efe commitb7cff04Copy full SHA for b7cff04

File tree

-3

lines changed

-3

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,15 +14,15 @@ def bisection(function, a, b): # finds where the function becomes 0 in [a,b] us`
`14`	`14`	`print("couldn't find root in [a,b]")`
`15`	`15`	`return`
`16`	`16`	`else:`
`17`		`-mid=(start+end)/2`
	`17`	`+mid=start+(end-start)/2.0`
`18`	`18`	`whileabs(start-mid)>10**-7:# until we achieve precise equals to 10^-7`
`19`	`19`	`iffunction(mid)==0:`
`20`	`20`	`returnmid`
`21`	`21`	`eliffunction(mid)*function(start)<0:`
`22`	`22`	`end=mid`
`23`	`23`	`else:`
`24`	`24`	`start=mid`
`25`		`-mid=(start+end)/2`
	`25`	`+mid=start+(end-start)/2.0`
`26`	`26`	`returnmid`
`27`	`27`
`28`	`28`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ def binary_search(sorted_collection, item):`
`45`	`45`	`right=len(sorted_collection)-1`
`46`	`46`
`47`	`47`	`whileleft<=right:`
`48`		`-midpoint=(left+right)//2`
	`48`	`+midpoint=left+(right-left)//2`
`49`	`49`	`current_item=sorted_collection[midpoint]`
`50`	`50`	`ifcurrent_item==item:`
`51`	`51`	`returnmidpoint`

Comments

(0)