An array A$[0..$n$1]$

of n

arbitrary and unsorted real numbers is given. We want to determine whether more than a third of the array elements have the same value. Worst$-$case time complexity of the most efficient algorithm that solves this problem is $\backslash$Theta

$(\_\_\_\_\_\_\_\_\_\_).$

Question $16$Answer

a$.$

logn $+$ n $+$ nlog$($n$/3)$

b$.$

n$/3+$ nlogn

c$.$

$($ nn$+$ logn $)/($ n$/3+3$logn $)$

d$.$

$($n $+$ logn$)$logn