Welcome, guest | Sign In | My Account | Store | Cart

Recipe 81188 revision 2 

def binary_search(seq, t):
    min = 0
    max = len(seq) - 1
    while True:
        if max < min:
            return -1
        m = (min + max) // 2
        if seq[m] < t:
            min = m + 1
        elif seq[m] > t:
            max = m - 1
        else:
            return m

Diff to Previous Revision

--- revision 1 2001-10-11 16:24:37
+++ revision 2 2014-03-03 18:09:00
@@ -1,9 +1,10 @@
 def binary_search(seq, t):
-    min = 0; max = len(seq) - 1
-    while 1:
+    min = 0
+    max = len(seq) - 1
+    while True:
         if max < min:
             return -1
-        m = (min + max) / 2
+        m = (min + max) // 2
         if seq[m] < t:
             min = m + 1
         elif seq[m] > t:

History