← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

9 第9章 中位数和顺序统计量

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.684Z

t minimum and maximum, at a cost of 2 comparisons per element, process elements in pairs.

Compare pairs of elements from the input first with each other, and then compare the smaller with the current minimum and the larger to the current maximum

, at a cost of 3 comparisons for every 2 elements. How you set up initial values for the c

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter009.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea