binarySearch

// Asset
#include<bits/stdc++.h>
using namespace std;
void binarySearch(int arr[], int element, int len)
{
    int low = 0;
    int high = len;
    while (low <= high)
    {
        int mid = (high+low)/2;
        int guess = arr[mid];
        if (guess == element)
        {
            cout<<"Element found at "<<mid<<" th index";
            return;
        }
        else if (guess < element)
            low = mid + 1;
        else if (guess > element)
            high = mid - 1;
    }
    cout<<"Not found";
    return;
}
int main()
{
    int n,elem;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin>>arr[i];
    sort(arr,arr+n);
    for(int i=0;i<n;i++)
        cout<<arr[i]<<' ';
    cout<<endl;
    cin>>elem;
    binarySearch(arr, elem, n);
    return 0;
}