Ques 2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int tc;
    cin >> tc;
    int n;
    cin >> n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin >> arr[i];
    for(int i=0;i<n-1;i++)
    {
        int key=i;
        for(int j=i+1;j<n;j++)
            if(arr[j]<arr[key])
                key = j;
        swap(arr[key],arr[i]);
    }
    while(tc--)
    {
        int q,ind;
        cin >> q;
        int low = 0, high = n-1;
        bool flag = false;
        while(low<=high)
        {
            int mid = (high+low)/2;
            if(arr[mid]==q)
            {
                flag = true;
                ind = mid;
                break;
            }
            if(arr[mid]<q)
                low = mid+1;
            else if(arr[mid]>q)
                high = mid-1;
        }
        if(flag)
            printf("%d Found at index %d\n",q,ind+1);
        else
            printf("%d is not found in the array\n",q);
    }

    return 0;
}