Anyone can prove me wrong?


If it is a majority element that is 2/3 of the array and guaranteed to be in the array then we can sort the array and get the middle index . Since it is at least 2/3 of the array , we can be sure that the middle guy will be the majority element.

this solution is O(n log n) since merge sorting is O(n log n).