← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

2 第2章 算法入门

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

c4 + c5 + c8 and b = c2 + c4 + c5 + c8). The running time is thus a linear function of n.

The worst case arises when the array is in reverse sorted order—that is, it starts out in decreasing order.

The procedure must compare each element A[i] with each element in the entire sorted subar

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea