Pairwise sorting network
id:
pairwise-sorting-network-285-10281569
title:
Pairwise sorting network
text:
The pairwise sorting network is a sorting network discovered and published by Ian Parberry in 1992 in Parallel Processing Letters. The pairwise sorting network has the same size and depth as the odd–even mergesort network. At the time of publication, the network was one of several known networks with a depth of O . It requires n / 4 + n − 1 comparators and has depth / 2 . The sorting procedure implemented by the network is as follows: Sort consecutive pairwise bits of the input
Sort all pairs in
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Pairwise_sorting_network
date created:
date modified:
2023-11-02T17:06:49Z
main entity:
{"identifier":"Q16999731","url":"https://www.wikidata.org/entity/Q16999731"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/en/7/7b/Pairwise_Sorting_Network_for_16_inputs.svg","width":771,"height":608}
fields total:
13
integrity:
14