title: TRANSFORMATION OF THE SIMPLEST SORTING NETWORKS TO AN ODD-EVEN BUTCHER NETWORK
abstract: All sorting algorithms are information-equivalent. Therefore, the choice of the most effective algorithmusually depends on its operation velocity and the capacity of used memory. At parallel, hardwareimplementation, the efficiency of sorting algorithms is also affected by the degree of utilization ofhardware resources; the latency of the resulting computing structure; the number and digit capacity ofthe sorted elements. The problem of sorting or ordering data is not formalized in the form of mat
journal: Izvestiâ ÛFU. Tehničeskie nauki