GATE | GATE CS 1996 | Question 38

Last Updated :
Discuss
Comments

The average number of key comparisons done in a successful sequential search in a list of length n is

log n

(n-1)/2

n/2

(n+1)/2

Share your thoughts in the comments