1. You are given an array(arr) of distinct integers, which is sorted and rotated around an unknown point. 2. You have to find the smallest element in O(logN) time-complexity
Input Format
An Integer N arr1 arr2.. n integers
Output Format
The smallest element
Constraints
1 <= N <= 10000 -10^9 <= arr[i] <= 10^9
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
9 15 16 19 21 23 24 1 2 12
Output
1