Scribd Logo
Upload

Welcome to Scribd!

  • Binary Search Code

    Uploaded by

    varun utkarsh
    10 views2 pages
    This C++ code implements a binary search algorithm to search for a target number in a sorted array. It takes user input for the array size and values, the target number, and performs a binary search by repeatedly calculating the mid-point of the current search subarray and comparing the target to that mid-value to determine if the search goes in the lower or upper half of the subarray. If found, it prints the position, otherwise it reports that the number was not found.

    Original Description:

    c++ code for binary search

    Original Title

    Binary search code

    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++ code implements a binary search algorithm to search for a target number in a sorted array. It takes user input for the array size and values, the target number, and performs a binary search by repeatedly calculating the mid-point of the current search subarray and comparing the target to that mid-value to determine if the search goes in the lower or upper half of the subarray. If found, it prints the position, otherwise it reports that the number was not found.

    Copyright:

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

    Binary Search Code

    Uploaded by

    varun utkarsh
    This C++ code implements a binary search algorithm to search for a target number in a sorted array. It takes user input for the array size and values, the target number, and performs a binary search by repeatedly calculating the mid-point of the current search subarray and comparing the target to that mid-value to determine if the search goes in the lower or upper half of the subarray. If found, it prints the position, otherwise it reports that the number was not found.

    Copyright:

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

    //This code is created by Ashsish

    #include<iostream.h>
    #include<conio.h>

    void main()
    {

    int arr[100],beg,mid,end,i,n,num;

    cout << "\n Enter the size of an array ";


    cin >> n;

    cout << "\n Enter the values in sorted order (asc or desc) \n";

    for(i = 0; i < n;i++)


    {
    cin >> arr[i];
    }

    /* Initialize beg and end value. */

    beg = 0;
    end = n-1;

    cout << "\n Enter a value to be searched in an array ";


    cin >> num;

    /* Run loop, while beg is less than end. */

    while( beg <= end)


    //This is a basic program
    {

    /* Calculate mid. */

    mid = (beg+end)/2;

    /* If value is found at mid index,


    the print the position and exit. */

    if(arr[mid] == num)
    {
    cout << "\nItem found at position "<< (mid+1);

    exit(0);

    } else if(num > arr[mid]) {

    beg=mid+1;

    } else if (num < arr[mid]) {

    end=mid-1;

    }
    //Please do like my code

    cout << "Number does not found.";


    }

    You might also like