I had this exercice in an exam which stated:

> 
> Find an algorithm which can search for the highest number in an
>  unsorted list and have a Big-Oh complexity of O(log(N)).
> 
> 
> 

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.

Is there such an algorithm?