原书出处
Introduction to Algorithms, Fourth Edition
9 第9章 中位数和顺序统计量
ch comparison is a match in the tournament in which the smaller of the two elements wins.
Since every element except the winner must lose at least one match, we can conclude that n – 1 comparisons are necessary to determine the minimum.
Hence the algorithm MINIMUM is optimal with respect to the number of comparisons performe
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea