Question: 13
(Choose 1 answer)
What is the primary difference between sequential search and binary search algorithms?
A. Sequential search requires the data to be sorted in ascending order, while binary search can work on
unsorted data as well
B. Binary search divides the search space into halves, while sequential search checks elements one by one
C. Sequential search exhibits greater efficiency and speed compared to binary search when applied to large
datasets containing a significant number of elements
D. Binary search is a versatile algorithm that can be applied to various types of data structures, including
arrays, linked lists, and trees, while sequential search is specifically designed to work only with arrays
