The linear search algorithm used for searching for a particular value 'x in a list requires: that the value 'x' actually be present in the list O using a recursive divide-and-conquer algorithm to divide the list into two smaller lists of equal size first sorting the list, then searching it for 'x' comparing 'x' with every item in the list starting with the first item