The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
22 Mar 2019 10:18 AM study24x7 study24x7

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is

A

Θ(n)

B

Θ(logn)

C

Θ(log*n)

D

Θ(1)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles