原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
e front of the list early, paying to move the element to the front before it is accessed.
To capture this concept, we use the idea of an inversion: a pair of elements, say a and b, in which a appears before b in one list, but b appears before a in another list. For two lists L and L′, let I(L, L′), called the
inversion count, denote the number of inversions between the two lists, that is, the numb
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea