Concept drill
sorted-array
GATE CSE & IT · Complexity Theory · 2000-2008
2
PYQs
100%
keyed
1
elite explanations
2
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2008 PYQ
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
mediumanswer keyelite explanation
2000 PYQ
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which o...
easyanswer key