better implementation for midpoint (TheAlgorithms#914)

Author: wuminbin

arithmetic_analysis/bisection.py

@@ -14,15 +14,15 @@ def bisection(function, a, b):  # finds where the function becomes 0 in [a,b] us
         print("couldn't find root in [a,b]")
         return
     else:
-        mid = (start + end) / 2
+        mid = start + (end - start) / 2.0
         while abs(start - mid) > 10**-7:  # until we achieve precise equals to 10^-7
             if function(mid) == 0:
                 return mid
             elif function(mid) * function(start) < 0:
                 end = mid
             else:
                 start = mid
-            mid = (start + end) / 2
+            mid = start + (end - start) / 2.0
         return mid
 
 

searches/binary_search.py

@@ -45,7 +45,7 @@ def binary_search(sorted_collection, item):
     right = len(sorted_collection) - 1
 
     while left <= right:
-        midpoint = (left + right) // 2
+        midpoint = left + (right - left) // 2
         current_item = sorted_collection[midpoint]
         if current_item == item:
             return midpoint