Scribd Logo
Upload

Welcome to Scribd!

  • Cautare Binara

    Uploaded by

    mohihek698
    9 views1 page
    This C++ program implements a binary search algorithm to search for a target value in a sorted array. It takes the array, target value, and array size as inputs. The binary search function recursively divides the search space in half by comparing the target to the middle element of the array until the target is found or the search space is empty. The function returns 1 if found or 0 otherwise. The main function gets array values, target, calls binary search and prints the result.

    Original Description:

    Original Title

    cautare binara

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program implements a binary search algorithm to search for a target value in a sorted array. It takes the array, target value, and array size as inputs. The binary search function recursively divides the search space in half by comparing the target to the middle element of the array until the target is found or the search space is empty. The function returns 1 if found or 0 otherwise. The main function gets array values, target, calls binary search and prints the result.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views1 page

    Cautare Binara

    Uploaded by

    mohihek698
    This C++ program implements a binary search algorithm to search for a target value in a sorted array. It takes the array, target value, and array size as inputs. The binary search function recursively divides the search space in half by comparing the target to the middle element of the array until the target is found or the search space is empty. The function returns 1 if found or 0 otherwise. The main function gets array values, target, calls binary search and prints the result.

    Copyright:

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

    #include <iostream>

    using namespace std;


    int binarySearch(int x[], int n,int hi) {

    int lo=1,m;
    int p=hi+1;
    while (lo <= hi) {
    m=(hi+lo) / 2;
    if(x[m]>=n){
    p=m;
    hi=m-1;
    }
    else
    lo=m+1;
    }
    if(x[p]==n)
    return 1;
    else return 0;

    }
    int main()
    {
    int a[50],x,n,lo,hi;
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    hi=n;
    cin>>x;
    cout<<binarySearch(a,x,hi);

    return 0;
    }

    You might also like