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

Firebase 9.0: A New Era of App Development

Firebase 9.0: A New Era of App Development Firebase, Google's mobile and web development platform, has just released its latest version, Firebase 9.0. This major update brings a number of new features and improvements, making it easier and faster than ever to build and deploy high-quality apps. Here are some of the highlights of Firebase 9.0: New AI Extensions powered by the PaLM API Firebase now includes a number of new AI Extensions that can be used to add powerful features to your apps, such as natural language processing, image recognition, and machine translation. Introducing the Extensions publishing experience Firebase Extensions are now available to be published and shared with the community. This makes it easy for developers to find and use the extensions they need, and it also gives developers the opportunity to share their own extensions with the world. Cloud Functions for Firebase 2nd gen supports Python Cloud Functions for Firebase is a serverless platform that lets y...
Post a Comment
Read more

Index Sequential Search

 Code for Index Sequential Search  import java . util .*; public class Index_search {     public static void main ( String [] args ) {         int i , a = 0 ;         Scanner in = new Scanner ( System . in );         int arr [] = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 };         System . out . println ( "Please enter the number to be find: " );         int num = in . nextInt ();         System . out . println ( "Please enter the steps to left" );         int steps = in . nextInt ();         in . close ();         for ( i = 0 ; i < arr . length ; ) {             if ( num == arr [ i ] ) {                 System . out . println ( "Number found in the first one. " + i );       ...
Post a Comment
Read more

Leap year Program in Java

import   java . util . Scanner ; // Input a year and find whether it is a leap year or not. public   class   Leap_year {      public   static   void   main ( String []  args ) {                   Scanner   in  =  new   Scanner ( System . in );          System . out . print ( "Please enter a year : " );          int   year  =  in . nextInt ();                   boolean   ans  =  checkyear ( year );          if  ( ans  ==  true ) {            ...
Post a Comment
Read more