Algorithmadvanced
Pairwise sorting network
Also called Parberry's pairwise network.
A network built from pairwise comparisons of wires that matches the depth of odd-even merge sort with fewer comparators.
A network built from pairwise comparisons of wires that matches the depth of odd-even merge sort with fewer comparators.
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 Y3SNG1 Edit this page History Report an error