5 Library for handling comparator networks in general and sort networks in
12 The distribution includes a number of utility applications for handling sort
13 networks. Most tools operate in the typical UNIX fashion of reading from STDIN
14 and writing to STDOUT, so that it is able to chain tools together.
16 The distribution includes the following utility programs:
19 Reads a list of values from STDIN and applies a given comparator network to
20 the list. The resulting list of printed to STDOUT.
23 Creates a batcher bitonic-merge-sort network with a given number of inputs
24 and prints the network to STDOUT. The number of inputs must be a power of
28 Does a brute-force check whether a given comparator network is a sort
29 network. It tries all 2^n 0-1-combinations resulting in exponential running
30 time, so only small networks can be tested within a reasonable time.
33 Remove an input by assuming positive or negative infinity to be applied to
34 one input and "winning" or "losing" all comparisons.
37 Display information about a comparator network in human readable form.
40 Combine two sort networks using the odd-even-merge network.
43 Reads a sort network and prints a normalized version to STDOUT. A
44 normalized sort network is a network in which all comparators face the same
48 Creates a odd-even-merge-sort network with a given number of inputs and
49 prints the network to STDOUT.
52 Prints a so-called "shmoo chart" of a comparator network to STDOUT. The
53 running time of this tool is exponential, roughly O(m * 2^n) where m is the
54 number of stages and n is the number of inputs.
57 Prints an ASCII version of a sort network to STDOUT.
60 Prints the TikZ / TeX sources of a graphic representation of a comparator
67 libsortnetwork has been written by Florian "octo" Forster.
68 You can reach Florian at <ff at octo.it>.