title: Find smallest number in Sorted Rotatable Array
body: <p>I came across this question in one Interview. Please help me in getting the solution.</p>
  
  <p>Question is:</p>
  
  <blockquote>
    <p>You have sorted rotatable array, i. e. the array contains elements which are sorted and it can be rotated circularly, like if the elements in array are [5,6,10,19,20,29] then rotating first time array becomes [29,5,6,10,19,20] and on second time it becomes [20,29,5,6,10,19] and so on.</p>
    
    <p>So you need to find the smallest element in the array at any point. You won’t be provided with number times array is rotated. Just given the rotated array elements and find out the smallest among them. In this case output should be 5.</p>
  </blockquote>