 Either way, asymptotically the worst-case cost and the expected cost of linear search are both O("n").The performance of linear search improves if the desired value is more likely to be near the beginning of the list than to its end.Therefore, if some values are much more likely to be searched than others, it is desirable to place them at the beginning of the list.