algorithm to find the three majority elements in an array

Question

Let\'s say there are three elements in a non-sorted array all of which appear more than one-fourth times of the total number of elements.

What is the most efficient

Answer 1

create a histogram of the entries, sort it, and take the three largest entries.