Editing Linked list (section)

===Speeding up search===
Finding a specific element in a linked list, even if it is sorted, normally requires O(''n'') time ([[linear search]]). 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. This scheme, handy for creating simple caches, ensures that the most recently used items are also the quickest to find again.

Another common approach is to "[[index (database)|index]]" a linked list using a more efficient external data structure. For example, one can build a [[red–black tree]] or [[hash table]] whose elements are references to the linked list nodes. Multiple such indexes can be built on a single list. The disadvantage is that these indexes may need to be updated each time a node is added or removed (or at least, before that index is used again).