Self-organizing Sequential Search Heuristics I've read the paper by Jon L. Bentley "Amortized analyses of self-organizing sequential search heuristics". It deals with different schemes for improving linear search. (such as after every access to an element move it to front or transpose neighboring elements) And at the end of the paper was a section for those who are interested in practical applications of this techniques. 

It says that such techniques has practical applications if you want to do a linear search quicker (obviously, it's true). 
But can you give some example of such problem? 
If we need to make fast searching , insertion and deletion why don't you use HashTable? I thought the only reason why we use Linked List is that it preserves order and its very easy to implement. Am I right? 
But with such heuristics we don't preserve order. But it's still easy to implement...

So for what purposes do we use such heuristics that don't preserves order for list?
Thank you very much!
The self-adjusting linked lists described by Bentley have practical applications in data compression.  For example, bzip2 uses move-to-front encoding (among many other tricks).  See also this paper by Bentley et al.