Related Articles

# GATE | GATE CS 2008 | Question 40

• Difficulty Level : Hard
• Last Updated : 09 Jun, 2019

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)

Explanation: If you answered Theta(1), then think of examples {1, 2, 2, 2, 4, 4}, {1, 1, 2, 2, 2, 2, 3, 3}

The Best way to find out whether an integer appears more than n/2 times in a sorted array(Ascending Order) of n integers, would be binary search approach.

1. The First occurence of an element can be found out in O(log(n)) time using divide and conquer technique,lets say it is i.
2. The Last occurrence of an element can be found out in O(log(n)) time using divide and conquer technique,lets say it is j.
3. Now number of occuerence of that element(count) is (j-i+1). Overall time complexity = log n +log n +1 = O(logn)

This solution is contributed by Nirmal Bharadwaj

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up