Essentially, this doubly linked list will move a node that is searched for and found closer to the front, like how a search engine would. It does by a random amount because that is proven to run at O(logn) time when an item is found compared to O(n) time
Essentially, this doubly linked list will move a node that is searched for and found closer to the front, like how a search engine would. It does by a random amount because that is proven to run at O(logn) time when an item is found compared to O(n) time