← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

第三部分 数据结构

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

orted, INSERT and DELETE can take Θ(1) time, but the remaining operations take Θ(n) time.

If instead the array is maintained in sorted order, then MINIMUM, MAXIMUM, SUCCESSOR, and PREDECESSOR take Θ(1) time

; SEARCH takes O(lg n) time if implemented with binary search; but INSERT and DELETE take

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea