Given a sorted array of integers, find the most occurring element in the array.
Expected to give a O(logN) solution.

Sample Input: 11111777998
Sample Output: 1

Can anyone describe how to go about a O(logN) solution?