binary_search.py

#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Wed Nov 14 21:46:17 2018

@author: manveet
"""
def binary_search(a,x):
    first_pos = 0
    last_pos = len(a)-1
    flag=0
    count=0
    while(first_pos <= last_pos and flag==0):
        count+=1
        mid = (first_pos+last_pos)//2
        if(x == a[mid]):
            flag = 1
            print("the elemnt is present at pos : "+str(mid))
            print("The number of iterations are: "+str(count))
            return
        else:
            if(x<a[mid]):
                last_pos = mid-1
            else:
                first_pos = mid+1
    print("the number is not present")
a = []
for i in range(1,1001):
    a.append(i)

binary_search(a,74)