5,337
edits
Parallel Algorithms: Difference between revisions
→Technique: Balanced Binary Trees
No edit summary |
|||
| Line 50: | Line 50: | ||
* Largest element | * Largest element | ||
* Nearest-one element | * Nearest-one element | ||
;Inputs | |||
* Array A[1..n] of elements | |||
* Associative binary operation, denoted * (e.g. addition, multiplication, min, max) | |||
;Outputs | |||
* A(1), A(1) * A(2), ..., A(1) * ... * A(n) | |||