 For example, one may sort the list and use binary search, or build an efficient search data structure from it.Should the content of the list change frequently, repeated re-organization may be more trouble than it is worth.As a result, even though in theory other search algorithms may be faster than linear search (for instance binary search), in practice even on medium-sized arrays (around 100 items or less) it might be infeasible to use anything else.