Sorting networks are networks consisting of wires that carry input values along with a number of interconnections between pairs of these wires, which function as comparators for swapping values on the wires if they are not in a desired order, or leaving them as is if they are. A graphical representation of a simple 4-input sorting network is as follows: For more information on the theory behind sorting please refer to the following links: https://en.wikipedia.org/wiki/Sorting_network Ian Parberry PhD has an interesting page detailing his research into sorting networks: http://larc.unt.edu/ian/research/sortingnetworks/ This C++ implementation is a simple console application to demonstrate the more »
↧