Associated Course(s):
Geeks Classes DSA
Geeks Classes in Noida

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

mohamadhegazy97 | 57 |

ManojBharadhwaj | 49 |

bhatabhi554 | 48 |

adityak12 | 48 |

RaghavJindal | 47 |

blackshadows | 940 |

SunkyuHwang | 794 |

bently_nixon | 701 |

mb1973 | 491 |

Shaurya Khanna | 491 |

akhayrutdinov | 5043 |

Ibrahim Nash | 4967 |

blackshadows | 4640 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.