For this Question: Loki is one mischievous guy. He would always find different ways to make things difficult for everyone. After spending hours sorting a coded array of size N (in increasing order), you realise it’s been tampered with by none other than Loki. Like a clock, he has moved the array thus tampering the data.  The task is to find the <b>minimum</b> element in it.The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of two lines. The first line of each test case consists of an integer N, where N is the size of array.
The second line of each test case contains N space separated integers denoting array elements.

Constraints:
1 <= T <= 100
1 <= N <= 10^5
1 <= A[i] <= 10^6

<b>Sum of "N" over all testcases does not exceed 10^5</b>Corresponding to each test case, in a new line, print the minimum element in the array.Input:
3
10
2 3 4 5 6 7 8 9 10 1
5
3 4 5 1 2
8
10 20 30 45 50 60 4 6

Output:
1
1
4

Explanation:
Testcase 1: The array is rotated once anti-clockwise. So minium element is at last index (n-1) which is 1.
Testcase 2: The array is rotated and the minimum element present is at index (n-2) which is 1.
Testcase 3: The array is rotated and the minimum element present is 4., I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;

class Main{
	public static void main (String[] args) {
		//code
				Scanner s = new Scanner(System.in);
				int t = s.nextInt();
				for(int j=0;j<t;j++){
	            	int al = s.nextInt();
		            int a[] = new int[al];
		            for(int i=0;i<al;i++){
			        a[i] = s.nextInt();
		            }
			        binSearchSmallest(a);
				    
				}
	
	}
		public static void binSearchSmallest(int a[]) {
		int s=0;
		int e = a.length - 1;
		int mid = 0;
		while(s<=e){
			mid = (s+e)/2;
			if(a[s]<a[e]){
				System.out.println(a[s]);
				return;
			}
			if(a[mid]>=a[s]){
				s=mid+1;
			}
			else{
				e=mid;
			}
			
			if(s == e){
				System.out.println(a[s]);
				return;
			}
		}

	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?