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 | ||
* Compaction | |||
;Inputs | ;Inputs | ||
No edit summary |
|||
| Line 50: | Line 50: | ||
* Largest element | * Largest element | ||
* Nearest-one element | * Nearest-one element | ||
* Compaction | |||
;Inputs | ;Inputs | ||