BinarySearchExample

ExampleOne

void binarySearch(int array[], int aim)
{
    int left=0, right=array_size-1, mid, ans;
    while (left<=right)
    {
        mid=(left+right)/2;
        if (array[mid]<aim)
            left=mid+1;
        else if (array[mid]>aim)
            right=mid-1;
        else
        {
            ans=array[mid];
            break;
        }
    }
    cout<<ans<<endl;
}