Skip to main content

9. BINARY SEARCH:python program, to search a number without using recursion

def binsearch(ar,key):
    low=0
    high=len(ar)-1
    while low<=high:
        mid=int((low+high)/2)
        if key==ar[mid]:
            return mid
        elif key<ar[mid]:
            high=mid-1
        else:
            low=mid+1
    else:
        return-263256
#main program
ra=[12,36,45,58,65,95,99]
item=int(input('enter the number to be searched:-'))
res=binsearch(ra,item)
if res>=0:
    print(item,'found at index',res)
else:
    print('SORRY',item,'NOT FOUND IN ARRAY')

Labels:

Comments

Post a Comment

THANK YOU FOR COMMENTING !
PLEASE SUBSCRIBE TO OUR WEBSITE FOR LATEST UPDATES

Popular posts from this blog

Programming for problem solving : Assignment no 1

 Assignment of programming for problem solving:  The questions for assignment is : The solution for the assignment is as follows :  Please subscribe the blog for more updates . Thank you! 🙏🙏
3 comments
Read more

1. Python program for railway reservation system

def reserve(CLASS):     if CLASS==1:         print('welcome to the REGULAR CLASS SEAT reservation')         dest=int(input('enter your destination in km  '))         stat=int(input('enter stations in between '))         price=10*dest         amount=price+(10*stat)         print('the price for 1 seat is =',amount)         seat=int(input('enter no of seats'))         total=amount*seat         print('your final price is =',total)         print('you will have to pay',total,'INR')         return total,seat,amount     if CLASS==2:         print('welcome to the FIRST CLASS TICKET reservation')         dest=int(input('enter your destination in km  '))         stat=int(input...
3 comments
Read more

BEE ASSIGNMENT

 Here is the solution of BEE ASSIGNMENT    QUESTION 1 - QUESTION 5 Question 6 to Question 10  For maths assignment : click here  
6 comments
Read more