Since you want to know why anyone would ever use linear search in a program when it is so inefficient. the reason that the learning coach need to give is option A. Linear search is perfect if the data is not sorted.
In regards to the use of linear search input data, it is known to be a kind of toll that does not require data to be sorted that is not to be in sorted way. In binary search input data, ti is one that need data to be in sorted form. It is also the case with sequential search.
Linear search can be a type that is often used to search for the little or largest value in any form of unsorted list instead of the act of searching for a match.
Note that It can do the work by keeping records or track of the biggest (or smallest) value and also does the work of updating the needed algorithm.
Therefore, Since you want to know why anyone would ever use linear search in a program when it is so inefficient. the reason that the learning coach need to give is option A. Linear search is perfect if the data is not sorted.
Learn more about Linear search from
https://brainly.com/question/13143459
#SPJ1
