A sequential search is faster than a binary search on sorted lists.

Name: A sequential search is faster than a binary search on sorted lists.
Brand: Quizplus
Rating: 4.8 (33 reviews)

Question

Quizplus · Accepted Answer

A binary search is faster than a sequential search on sorted lists because it divides the list in half repeatedly, reducing the search space exponentially, while a sequential search checks each element one by one.

A Sequential Search Is Faster Than a Binary Search on Sorted