Problem MAJOR

Problem in Short: You have to find the majority element(which appears more than n/2 times) in a given array in O(n) time.