A sequential search is good only for very small lists because the average search length of a sequential search is half the size of the list.

Question

Quizplus · Accepted Answer

Sequential search, also known as linear search, involves checking each element in the list one by one until the desired element is found or the end of the list is reached. On average, it will indeed take searching through half the size of the list to find an element, making it inefficient for large lists compared to more advanced search algorithms like binary search.

A Sequential Search Is Good Only for Very Small Lists