If we know the size of the array to sort, it is possible to implement a sorting network by hard-coding the connections between the lines.
We can see this as a direct mapping of the picture.
When the array size is unknown, the implementation can be made more flexible by using a formula to decide when to compare and exchange the values [1]}.
