Sequential search is a(n) ____ algorithm in the worst case.
A) Q(1)
B) Q(n)
C) Q(2n)
D) Q(n2)

Question

Quizplus · Accepted Answer

Sequential search algorithm searches the elements one by one until it finds the target element or reaches the end of the list. In the worst case, the target element is not present in the list, and we have to search all n elements, which means the time complexity is O(n). Therefore, the best choice is B, which corresponds to O(n) time complexity.

Sequential Search Is A(n) ____ Algorithm in the Worst Case