Parallel Algorithms: Difference between revisions

Parallel Algorithms (view source)

154 bytes added , 23 April 2020

5,323

edits

@@ Line 557: / Line 557: @@
 ;Notes
-* In step 2, you can also hook rooted trees for better empirical performance
+* Without step 3, the algorithm will run in <math>O(n)</math> time instead of <math>O(\log n)</math> but the result will be valid.
+* In step 2, you can hook rooted trees in addition to rooted stars for better empirical performance
 {{ hidden | Proof |