Linear search checks every item in the list and has a worst-case **** of O(n).

The linear search algorithm starts at the **** of the list and checks each item in turn until the target item is found.

In a linear search, the worst-case scenario occurs when the target item is **** or not in the list.

In a linear search, the average time complexity is **** of O(n), where n is the number of items in the list.