A sequential search of an n-element list takes ____ key comparisons if the item is not in the list. A) 0 B) n/2 C) n D) n²

Question

Quizplus · Accepted Answer

In a sequential search, we have to compare the key with each element of the list until either we find the key or we reach the end of the list. Therefore, in the worst case scenario, we will have to make n comparisons, which is the length of the list. If the key is not in the list, we will have to search the entire list of n elements.

A Sequential Search of an N-Element List Takes ____ Key