save project

my_search.py

@@ -9,12 +9,12 @@ def binary_search(alist,num):
     high=len(alist)-1
     high=len(alist)-1
     while low <= high:
     while low <= high:
         mid = (low+high) // 2 
         mid = (low+high) // 2 
-        num = alist[mid]  
-        if num == num:
+        guess = alist[mid]  
+        if guess == num:
             return mid
             return mid
             break
             break
-        elif num < num:
+        elif guess < num:
             low = mid+1
             low = mid+1
-        elif num > num:
+        elif guess > num:
             high = mid-1
             high = mid-1
 print(binary_search(alist,1))
 print(binary_search(alist,1))
\ No newline at end of file