5,337
edits
Parallel Algorithms: Difference between revisions
→Technique: Balanced Binary Trees
| Line 73: | Line 73: | ||
C(h, i) = B(h, i) | C(h, i) = B(h, i) | ||
if i odd, 3 <= i <= n/2^h | if i odd, 3 <= i <= n/2^h | ||
C(h, i) = C(h+1, i/2) | C(h, i) = C(h+1, i/2) * B(h, i) | ||
return C(0, :) | return C(0, :) | ||
</pre> | </pre> | ||