 In particular, when the list items are arranged in order of decreasing probability, and these probabilities are geometrically distributed, the cost of linear search is only O(1).Linear search is usually very simple to implement, and is practical when the list has only a few elements, or when performing a single search in an un-ordered list.When many values have to be searched in the same list, it often pays to pre-process the list in order to use a faster method.