Question: An array A[1::n] is said to have a majority element if more than half of its entries are the same.
We would like to determine whether a given array A has a majority element, and if so, find the element.
Can you find the element of an array?
Q- Assume A is an array of integers. Using sorting, show how to solve the majority element problem in O(n log n) time.
You need to implement this in java language. You need to provide the answer as soon as possible.