Texonom
Texonom
/
Computing
Computing
/Computing Theory/Algorithm/Sort Algorithm/Sorting Network/
0-1 principle
Search

0-1 principle

Creator
Creator
Seonglae Cho
Created
Created
2023 Sep 21 7:13
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Oct 25 16:13
Refs
Refs

Assumption: your comparators understands integer or floating numbers.

If a sorting network sorts every sequence of 0's and 1's, then it sorts every arbitrary sequence of values.
 
 
 
 
Sorting network
In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks.
Sorting network
https://en.wikipedia.org/wiki/Sorting_network#Zero-one_principle
Sorting network
 
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Computing Theory/Algorithm/Sort Algorithm/Sorting Network/
0-1 principle
Copyright Seonglae Cho