The minimum number of comparisons required to determine if an integer appears…
PYQ GATE 2008
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.
Θ(log n)
- C.
Θ(log* n)
- D.
Θ(1)
Attempted by 448 students.
Sign up free to check your answer
Sign up freeLoading lesson…