原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
ge. If (x, y) is an inversion before the swap, it no longer is afterward, and vice versa.
Therefore, if two consecutive elements x and y swap positions in a list L, then for any other list L′, the value of the inversion count I(L, L′) either increases by 1 or decreases by 1. As we compare MOVE-TO-F
RONT and FORESEE searching and modifying their lists, we’ll think about MOVE-TO-FRONT exec
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea