Binary Search in DSA using Python

Program 1

# Implementation of 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: "))
low=0
high=n-1
flag=False
while(low<=high):
    mid=(low+high)//2
    if(s==mylist[mid]):
         flag=True
         break
    elif(s>mylist[mid]):
        low=mid+1
    else:
        high=mid-1

if(flag):
    print("Searching success ")
else:
    print("Searching  not success ")