# Burly Numbers

Computer Science Level pending

In an array $$A[1 ... n ]$$ with integer elements in the range $$1$$ to $$n^2$$, we call a number burly if it occurs at least $$\frac{n}{2}$$ times in $$A$$. Which of the following is the best scheme for efficiently finding all the burly numbers in $$A$$.

×