一句话：用比较网络的单调性重新解释 Parberry 成对排序网络，并厘清其与 Batcher 归并交换网络的关系。
Batcher 的归并交换排序网络是实际中最好的 oblivious 排序算法之一，而 Parberry 后来提出的成对网络性能相当却长期被忽视，原因之一是其设计不易识别。本文旨在纠正这种不平衡。作者不再使用传统的零一原则来推导 Parberry 网络，而是转向比较网络中更基本的单调性性质，并先回顾记号与 Batcher 构造。通过这一视角，论文拆解了 Parberry 算法，解耦了它与 Batcher 方法的紧密关系，并阐明其设计依据。该工作属于理论性 pearl，主要贡献是对排序网络构造与正确性推理的重新阐释。
Batcher’s “merge exchange” sorting network, discussed in a previous pearl (Hinze & Martin, 2016), remains one of the best practical algorithms for oblivious sorting, even almost half a century after its inception. So it is surprising that an algorithm with exactly the same level of performance, devised two decades later by Parberry (1992), has been relatively overlooked. Perhaps a reason for its lack of celebrity is that Parberry’s design is not immediately recognizable, whereas the Batcher method has a familiar ring, as a hardwired implementation of merge sort. Here we hope to rectify this imbalance by unravelling Parberry’s algorithm and uncoupling its close relationship to Batcher’s. Interestingly, Parberry derives his network using the zero-one principle (Knuth, 1998). We abandon this traditional method, in favour of a feature of comparison networks that we consider to be more fundamental: monotonicity. We shall see that this property, used before to demystify Batcher’s merger (Hinze & Martin, 2016), also helps to shed some light on Parberry’s design. To keep the pearl reasonably self-contained we start with a quick recap of the notation and Batcher’s construction.