Daniel G O'Connor et al. patented in 1945 the idea of an ordering system with n-line through exchanges in electronic devices . This works consisted in ordering elements that arrived through the buses, considering the same amount of input elements as the output of the device, among the advantages that were identified with the technique was the saving of operations when ordering a set of data, due to the above, the principle of a Sorting Network was born.
Also, the operations that integrate a SN are known as comparators. Comparison and interchange among two elements are the operations performed by a comparator. Thus, if a comparator that receives the elements (x0,y1) to be ordered, this means that x0 must not be larger than x1. Hence, after introducing a given size n list and go through by set of comparators, then output should be a monotonically non decreasing ordered list. The SN are called oblivious, that means that their comparisons are independent of the preceding comparators and input data .
In order to verify the Sorting Networks(SN) validity, it really sorts any input configuration, it is necessary to evaluate all the n! possible permutations. However, the Theorem Zero-One is used to verify the SN validity, reducing the number of evaluations . This theorem affirms that, a SN is able to order any list of n elements not regulated, whenever it is able to order binary strings in a non-decreasing order.
In this place it is possible to validate a network using the theorem. The implementation was programmed in C language and is capable of evaluating networks up to n = 16.
 Nelson Raymond J. O’Connor, Daniel G. Sorting system with n-line sorting switch. United States Patent number 3,029,413, 6, April 1962.
 Donald E. Knuth. The Art of Computer Programming, Volume 3: (2Nd Ed.) Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1998.