Linear search is a way to find something like a word or target value in a list of items. When the linear search is performed, the mechanism looks at each item in the list one-by-one until it has found the target value or word. There are different performance cases in reference to the linear search algorithms.
The best case algorithm in computers is when this happen in the best time or when the conditions are best. If an item is listed as the first in the list, this is the best case because it will be found the quickest. If the item is the last element in the list or it is not there at all, then it is the worst case.
Answer Anonymously
Copy Link
