Concept drill
average case
GATE CSE & IT · Searching · 1996-2012
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 →2012 PYQ
Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
easyanswer keyelite explanation
1996 PYQ
The average number of key comparisons done on a successful sequential search in list of length n is
easyanswer key