Scribd Logo
Upload

Welcome to Scribd!

  • BSEARCH

    Uploaded by

    iqra anees
    8 views2 pages
    The document describes a binary search algorithm. It defines a function called Bsearch that takes an array, the size of the array, and a search value as parameters. The function searches the sorted array using a binary search approach, recursively dividing the search space in half and focusing on one half at a time. It returns the index of an element if found, or -1 if not found. The main function prompts the user to enter array elements and a search value, calls Bsearch to search the array, and prints whether the element was found and if so, at what location.

    Original Description:

    Original Title

    BSEARCH.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a binary search algorithm. It defines a function called Bsearch that takes an array, the size of the array, and a search value as parameters. The function searches the sorted array using a binary search approach, recursively dividing the search space in half and focusing on one half at a time. It returns the index of an element if found, or -1 if not found. The main function prompts the user to enter array elements and a search value, calls Bsearch to search the array, and prints whether the element was found and if so, at what location.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views2 pages

    BSEARCH

    Uploaded by

    iqra anees
    The document describes a binary search algorithm. It defines a function called Bsearch that takes an array, the size of the array, and a search value as parameters. The function searches the sorted array using a binary search approach, recursively dividing the search space in half and focusing on one half at a time. It returns the index of an element if found, or -1 if not found. The main function prompts the user to enter array elements and a search value, calls Bsearch to search the array, and prints whether the element was found and if so, at what location.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    BINARY SEARCH

    #include<iostream.h>
    #include<conio.h>
    void main()
    {
    clrscr();
    int Bsearch(int[],int,int);
    int A[100],N,x,pos,i;
    cout<<"Enter size of an array:";
    cin>>N;
    cout<<"\n Enter elements in an array:";
    for(i=0;i<N;i++)
    {
    cin>>A[i];
    }
    cout<<"\n Enter elements you want to search:";
    cin>>x;
    pos=Bsearch(A,N,x);
    if(pos==-1)
    cout<<"\n Element not found";
    else
    cout<<"\n Element found at location number="<<pos;
    getch();
    }

    int Bsearch(int A[],int N,int x)


    {
    int beg,mid,last;
    beg=0;
    last=N-1;
    while(beg<=last)
    {
    mid=(beg+last)/2;

    BINARY SEARCH
    if(A[mid]==x)
    return mid;
    else
    if(x>A[mid])
    beg=mid+1;
    else
    last=mid-1;
    }
    return -1;
    }

    You might also like