原书出处
Introduction to Algorithms, Fourth Edition
8 第8章 线性时间排序
ove that an oblivious compare-exchange algorithm produces a sorted result. It states that
if an oblivious compare-exchange algorithm correctly sorts all input sequences consisting of only 0s and 1s, then it correctly sorts all inputs containing arbitrary values.
COMPARE-EXCHANGE-INSERTION-SORT(A, n) 1 for i = 2 to n 2 for j = i – 1 downto 1 3 COMPARE
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter008.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea