findinsortrotate.cpp

#include <bits/stdc++.h>

// Aarif Khan
// Codechef: https://www.codechef.com/users/aarifkhan_7
// Github: https://github.com/aarifkhan7

#define pi (3.141592653589)
#define MOD 1e9+7
#define ll long long int
#define all(x) x.begin(), x.end()
#define range(a, b) for(int i = a; i < b; i++)
#define range1(a, b) for(int j = a; j < b; j++)
#define inint(x) int x; cin >> x;
#define inarr(x, n) int arr[n]; range(0, n){cin >> x[i];}
#define inll(x) ll x; cin >> x;
#define instr(x) string x; cin >> x; 
#define printc(cont) for(auto x : cont) cout << x << ' '; cout << '\n';
#define printp(cont) for(auto x : cont) cout << x.first << ' ' << x.second << '\n';
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define pii pair<int,int>
#define vi vector<int>
#define pb push_back
#define mp make_pair

using namespace std;

bool bs(int arr[], int low, int high, int t){
    if(high < low)
        return false;
    int mid = (low + high) / 2;
    if(arr[mid] == t){
        return true;
    }else{
        if(arr[mid] < t){
            return bs(arr, mid + 1, high, t);
        }else{
            return bs(arr, 0, mid - 1, t);
        }
    }
}

void solve(){
    inint(n);
    inarr(arr, n);
    inint(target);
    int pivot = 0;
    range(0,n){
        if(arr[i] > arr[pivot]){
            pivot = i;
        }
    }
    pivot++;
    if(bs(arr, 0, pivot-1, target) || bs(arr, pivot, n-1, target)){
        cout << "true\n";
    }else{
        cout << "false\n";
    }
}

int main()
{
    fast;
    int t; cin >> t;
    while(t--){
        solve();
    }
    return 0;
}