Research the efficiency of «circle» sorting NET

Abstract

In this work reviewed the sorting by pairwise exchange as sorting networks of "ring" type.In such a sorting network generated more connections between the extreme elements of the array.This, in turn, suggests creating a "ring" structure of connections.A simulation of this approach, which showed its efficiency by reducing the number of sorting cycles compared to sorting network type "tape".Formation of the "ring"in odd sort leads to a significant reduction in the number of cycles in most cases. Results of the work can be used in a specific hardware implementation associative processor.