Time complexity Question

Question

What should be the time complexity of this one?

Given array of n elements leading element of the array is the element which repeated more than n/2 times in array. What is time complexity to find the leading element in array s.t.

1. $\theta$($logn)$
2.  $\theta$(n)
3. $\theta$ $(nlog n)$
4. $\theta$$(n^2)$

With a proper explanation, please.

Comments

see here

https://www.geeksforgeeks.org/majority-element/

---

The answer given is logn.

That is what confuses me.

I already checked out that link.

---

if array is sorred then log n

if array is not sorted  then n

---

Answer for this should be theta(n)