Algorithmresearch
Valiant's parallel merge
Also called Valiant's merge.
Merges two sorted lists in O(log log n) parallel rounds using comparisons.
Merges two sorted lists in O(log log n) parallel rounds using comparisons.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag HPT34J Edit this page History Report an error