Sorted data can also be searched using a linear search: A. True.
What is a linear search?
A linear search is also referred to as sequential search and it can be defined as a type of search algorithm that is designed and developed for finding (searching) an element within a data set or list of data, regardless of whether or not the data are sorted.
What is a binary search?
A binary search can be defined as an efficient search algorithm that is designed and developed for finding (searching) an element from a sorted list of data only, especially by using the run-time complexity of 0(logN).
In this context, we can infer and logically deduce that sorted data can also be searched using a linear search.
Read more on linear search here: https://brainly.com/question/21366114
#SPJ4
