原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
ent followed by moving it forward two places (entailing two swaps) incurs a total cost 8.
The goal is to minimize the total cost of calls to LIST-SEARCH plus the total number of swaps performed. The online algorithm that we’ll explore is MOVE-TO-FRONT(L, x). This procedure first searches for x in the doubly linked list L,
and then it moves x to the front of the list.1 If x is located at position r = rL(x) befo
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea