In many cases of list searching, certain items in the list are retrieved more frequently than others.
The performance of linear search in such cases improves if these frequently sought items are placed at the beginning of the list.
One data structure that allows this is a self-organizing list, in which list elements are rearranged so that frequently accessed items move to or toward the front of the list.
Write a linear search function for such a self-organizing list using a move-to-the front strategy, in which the item being retrieved is moved to the front of the list. Assume that the list is stored in an array or a vector.