Many people give the solution of O(lg(n)) time complexity. But all these solutions are based on some certain data structure such as binary tree. Build such a tree will cost another O(nlg(n)) time. So why not directly find the max of the array?
The logN solution doesn't need any data structure.
Check out a sharing post here.