← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

26 第26章 并行算法

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

hat uses recursive spawning to perform the same function with Θ(n) work and Θ(lg n) span.

A related problem is that of computing a ⊗-scan, sometimes called a ⊗-prefix computation, on an array x[1 : n], where ⊗ is once again an associative operator. The ⊗-scan, implemented by the serial procedure SCAN, produces the array

y[1 : n] given by y[1] = x[1], y[2] = x[1] ⊗ x[2], y[3] = x[1] ⊗ x[2] ⊗ x[3], ⋮ y[n] = x[

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea