searchRotatedSortedArr.cpp

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff                 first
#define ss                 second
#define endl               "\n"
#define ll                 long long
#define ld                 long double
#define loop(a, b, c)      for(ll (a) = (b); (a)<=(c); (a)++)
#define looprev(a, b, c)   for(ll (a) = (b); (a)>=(c); (a)--)
#define pb                 push_back
#define mp                 make_pair
#define pii                pair<ll, ll>
#define vi                 vector<ll>
#define mii                map<ll, ll>
#define ump                unordered_map<ll, ll>
#define pqb                priority_queue<ll>
#define pqs                priority_queue<int, vi, greater<ll> >
#define setbits(x)         __builtin_popcountll(x)
#define zrobits(x)         __builtin_ctzll(x)
#define mod                1000000007
#define inf                1e18
#define ps(x, y)           fixed<<setprecision(y)<<x
#define mk(arr,n,type)     type *arr = new type[n];
#define w(t)               int x; cin>>x; while(x--)
// mt19937                    rng(chrono::steady_clock::now,time_since_epoch(),count());
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> pbds;

    
void file_i_o(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	/* #ifndef ONLINE_JUDGE
		freopen("input.txt", "r", stdin);
		freopen("output.txt", "w", stdout);
	#endif */
}



int search(int* arr, int n, int key) {
    // Write your code here.

	int pivot = -1;

	int start = 0;
	int end = n-1;

	while(start <= end) {
		int mid = (start + end)/2;

		if(arr[mid] > arr[mid+1]) {
			pivot = mid;
			break;
		}
		else if(arr[mid] >= arr[start]){
			start = mid + 1;
		}
		else {
			end = mid - 1;
		}
	}

	if(pivot == -1) {
		start = 0;
		end = n-1;
	}
	else if(arr[0] > key) {
		start = pivot+1;
		end = n-1;
	}
	else {
		start = 0;
		end = pivot; 
	}

	while(start <= end) {
		int mid = (start + end)/2;

		if(arr[mid] == key){
			return mid;
		}
		else if(arr[mid] > key) {
			end = mid - 1;
		}
		else{
			start = mid + 1;
		}
	}

	return -1;

}





int main(int argc, char const *argv[]) {

	file_i_o();

	clock_t start, end;
    start = clock();

	w(t){

	/*  Write Code Here  */
		int n;
		cin >> n;

		int arr[n];

		for(int i = 0; i < n; i++) {
			 cin >> arr[i];
		}

		int key;

		cin >> key;

		cout << search(arr, n, key) << endl;

	}

	end = clock();
	
	double time_taken=double(end-start)/double(CLOCKS_PER_SEC);
    cerr<<"\nTime : "<<fixed<<time_taken<<setprecision(5)<<" s \n";
    cerr<<"\n"<< "Coded By : S!r Black-D3vil" <<"\n";

	return 0;
}