Minimum element in sorted and rotated array [EASY]

Company: Times-Internet, Snapdeal, Morgan Stanley,Microsoft, Amazon, Adobe


Question:

A sorted array A[ ] with distinct elements is rotated at some unknown point, the task is to find the minimum element in it.

Expected Time Complexity: O(Log n)

Input:

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.

Output:
Corresponding to each test case, in a new line, print the minimum element in the array.

Constraints:

1 ≤ T ≤ 200
1 ≤ N ≤ 500
1 ≤ A[i] ≤ 1000

Example:

Input
1
5
4 5 1 2 3

Output
1

CODE: Naive solution

import java.util.*;

import java.lang.*;

import java.io.*;

class GFG {

public static void main (String[] args) {

Scanner sc = new Scanner (System.in);

int m = sc.nextInt();

for(int mi=0;mi<m;mi++){

    int n = sc.nextInt();

    int []ar= new int [n];

    for(int i=0;i<n;i++){

        ar[i]=sc.nextInt();

    }

    Arrays.sort(ar);

    System.out.println(ar[0]);

}

}

}

EXECUTION TIME:0.24s