Question: 10
(Choose 1 answer)
Which of the following statements is true regarding search algorithms for a list of elements?
A. Binary search is more efficient than sequential search for large lists, but it requires the list to be sorted.
B. Binary search can be used on an unsorted list to improve search efficiency compared to sequential search.
C. Sequential search requires fewer comparisons than binary search in the worst case, regardless of whether
the list is sorted or not.
D. Sequential search and binary search require the same number of comparisons in the worst case if the list
is sorted.
