save project

my_search.py

@@ -12,11 +12,11 @@ def binary_search(alist,num):
     while l<=h:
     while l<=h:
         m=(l+h)//2
         m=(l+h)//2
         g=alist[m]
         g=alist[m]
-        if g==bg:
+        if g==num:
             return m
             return m
-        elif g<bg:
+        elif g<num:
             l=m+1
             l=m+1
-        elif g>bg:
+        elif g>num:
             h=m-1
             h=m-1
     return num
     return num
 a=binary_search(alist,num)
 a=binary_search(alist,num)