Binary Search in DSA Python

Program 1

# This is a program for Binary Search
import os
os.system('cls')
mylist=[]
n=int(input("Enter the limit"))
print("Enter an element")
for i in range(n):
    x=int(input())
    mylist.append(x)
mylist.sort()  

s=int(input("Enter an element for search"))
f=False
low=0
high=n-1
while(low<=high):
    mid=(low+high)//2
    if(s==mylist[mid]):
        f=True
        break
    if(s>mylist[mid]):
        low=mid+1
    else:
        high=mid-1
if(f==True):
    print("Searching success")            
else:
    print("Searching not success")