List some significant differences between a linear search and a binary search.(1 point) Responses A binary search only works on sorted data structures, but linear search can work on any. A binary search only works on sorted data structures, but linear search can work on any. A linear search is more challenging to implement than a binary search is. A linear search is more challenging to implement than a binary search is. A linear search is faster than a binary search, especially when dealing with larger datasets. A linear search is faster than a binary search, especially when dealing with larger datasets. A binary search is always slower, and a linear search is always faster, regardless of the size or structure of the dataset.
The correct answer is:
- A binary search only works on sorted data structures, but linear search can work on any.
- A linear search is more challenging to implement than a binary search.
- A binary search is always faster than a linear search, especially when dealing with larger datasets.