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) (n)
(A) A
(B) B
(C) C
(D) D
Answer: (B)
Explanation: Please see the post Check for majority element in a sorted array for details.
Quiz of this Question
Recommended Posts:
- Algorithms | Misc | Question 16
- Algorithms | Misc | Question 11
- Algorithms | Misc | Question 11
- Algorithms | Misc | Question 3
- Algorithms | Misc | Question 13
- Algorithms | Misc | Question 6
- Algorithms | Misc | Question 7
- Algorithms | Misc | Question 8
- Algorithms | Misc | Question 9
- Algorithms | Misc | Question 10
- Algorithms | Misc | Question 11
- Algorithms | Misc | Question 12
- Algorithms | Misc | Question 13
- Algorithms | Misc | Question 14
- Algorithms | Misc | Question 15
- C | Misc | Question 1
- C | Misc | Question 2
- C | Misc | Question 7
- C | Misc | Question 6
- C | Misc | Question 5
