title: Finding the minimum in an unsorted array in logarithmic time
body: <p>Is there an algorithmic approach to find the minimum of an unsorted array in logarithmic time ( O(logn) )? Or is it only possible in linear time? I don't want to go parallel.</p>
  
  <p>Thanks</p>
  
  <p>Michael</p>