Linear & binary search with Python

Goal: To understand how to implement the concept in a real project.

 

Python

pos = -1

def search(list, n):

	l = 0
    u = len(list) -1
    
    while l <= u:
    	mid = (l+u) // 2
        
        if list[mid] == n:
        	globals()['pos'] = mid
            return True
        else:
        	if list[mid] < n:
            	l = mid;
            else:
            	u = mid;
                
    return False
                
list = [4, 7, 8, 12, 43, 46, 99, 102, 802, 702]
n = 802

if search(list, n):
	print("Found at ", pos+l)
else:
	print("Not Found")