 This is one of the primary disadvantages of linked lists over other data structures.In addition to the variants discussed above, below are two simple ways to improve search time.In an unordered list, one simple heuristic for decreasing average search time is the "move-to-front heuristic", which simply moves an element to the beginning of the list once it is found.