Scribd Logo
Upload

Welcome to Scribd!

  • 399

    Uploaded by

    gopi raand
    8 views2 pages
    The document contains code to implement binary search on an array. It first takes input from the user to specify the number of elements in the array and their values. It then takes input for the element to search. It initializes the start and end indexes and recursively calls a binary search function to search for the element in the sorted array. The function takes mid point between start and end, compares the element to search with the mid element and recursively calls itself by updating the start or end index until the element is found or end is less than start.

    Original Description:

    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
    The document contains code to implement binary search on an array. It first takes input from the user to specify the number of elements in the array and their values. It then takes input for the element to search. It initializes the start and end indexes and recursively calls a binary search function to search for the element in the sorted array. The function takes mid point between start and end, compares the element to search with the mid element and recursively calls itself by updating the start or end index until the element is found or end is less than start.

    Copyright:

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

    399

    Uploaded by

    gopi raand
    The document contains code to implement binary search on an array. It first takes input from the user to specify the number of elements in the array and their values. It then takes input for the element to search. It initializes the start and end indexes and recursively calls a binary search function to search for the element in the sorted array. The function takes mid point between start and end, compares the element to search with the mid element and recursively calls itself by updating the start or end index until the element is found or end is less than start.

    Copyright:

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

    #include <stdio.

    h>
    using namespace std;
    #include<iostream>

    int main()
    {
    int beg,end,item,mid,n;
    int arr[n];
    cout<<"Enter number of elements in array: ";
    cin>>n;
    cout<<"Enter "<<n<<" number of elements:";
    for(int i = 0;i<n;i++)
    cin>>arr[i];
    cout<<"Enter the number you want to search: ";
    cin>>item;
    beg = 0;
    end = n;
    for(int i =0;i<n;i++)
    { mid = (beg+end)/2;
    if(item == arr[mid])
    { break;
    }
    else if(item > arr[mid])
    { beg = mid+1;
    end = end;
    cout<<"Element found";
    break;
    }
    else if(item < arr[mid])
    { end = mid-1;
    beg = beg;
    cout<<"Element found";
    break;
    }
    else
    cout<<"Element not found.";
    }
    cout<<"Element found at position "<<mid;
    return 0;
    }
    #include <stdio.h>
    using namespace std;
    #include<iostream>
    int BS(int a[],int beg,int item,int end)
    { int mid = (beg+end)/2;
    if(item == a[mid])
    { cout<<"Element found at position : "<<mid;
    }
    else if(item < a[mid])
    {
    BS(a,beg,mid,mid-1);
    }
    else if(item < a[mid])
    {
    BS(a,mid+1,mid,end);
    }
    }
    int main()
    {
    int beg,end,item,mid,n,result;
    int arr[n];
    cout<<"Enter number of elements in array: ";
    cin>>n;
    cout<<"Enter "<<n<<" number of elements:";
    for(int i = 0;i<n;i++)
    cin>>arr[i];
    cout<<"Enter the number you want to search: ";
    cin>>item;
    beg = 0;
    end = n;
    result = BS(arr,beg,mid,end);
    cout<<"Element found at position "<<result;
    return 0;
    }

    You might also like