If the order that items in a list are stored is not important, you can frequently speed searching with the heuristic known as move to front: Whenever an item is accessed, move it to the front of the...

If the order that items in a list are stored is not important, you can frequently speed searching with the heuristic known as move to front: Whenever an item is accessed, move it to the front of the list. This action usually results in an improvement because frequently accessed items tend to migrate toward the front of the list, whereas less frequently accessed items tend to migrate toward the end of the list. Consequently, the most frequently accessed items tend to require the least searching. Implement the move-to-front heuristic for linked lists.