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

Name: Sequential search is a(n) ____ algorithm in the worst case. A) 1 B) Q (n) C) Q (2n) D) Q (n 2 )
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

Quizplus · Accepted Answer

Sequential search has a worst-case time complexity of Q(n), meaning it could potentially search through the entire list. Therefore, the best choice would be a time complexity that is less than Q(n), which is option B.

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