title: Searching algorithm with complexity O(log n), UNSORTED list/array
body: <p>I had this exercice in an exam which stated:</p>
  
  <blockquote>
    <p>Find an algorithm which can search for the highest number in an
    unsorted list and have a Big-Oh complexity of O(log(N)).</p>
  </blockquote>
  
  <p>The only searching algorithm with a log n complexity that I have found is the binary search algorithm but that one requires my list/array to be sorted.</p>
  
  <p>Is there such an algorithm?</p>