title: Searching a number in a rotated sorted Array
body: <p>Given a Sorted Array which can be rotated find an Element in it in minimum Time Complexity.</p>
  
  <p>eg : Array contents can be  [8, 1, 2, 3, 4, 5]. Assume you search 8 in it.</p>