Number of comparisons required for an unsuccessful search of an element in a sequential search, organized, fixed length, symbol table of length L is
(A) L
(B) L/2
(C) (L+1)/2
(D) 2L
Answer: (A)
Explanation: In Sequential search, in order to find a particular element, each element of the table is searched sequentially until the desired element is not found.
So, in case of an unsuccessful search, the element would be searched until the last element and it would be a worst case when number of searches are equal to the size of the table.
So, option (A) is correct.
Quiz of this Question
Article Tags :
Recommended Articles