GATE | CS | 2008 | Algorithms | Complexity Analysis | Question 40
Last Updated :
Discuss
Comments
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
Θ(n)
Θ(logn)
Θ(n*logn)
Θ(1)
This question is part of this quiz :
Top MCQs on Array Data Structure with Answers,GATE CS 2008,Algorithms GATE CS PYQ Quiz,Complexity Analysis GATE CS PYQ QuizShare your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy