X-Git-Url: https://git.octo.it/?a=blobdiff_plain;f=README;h=3778ddea4f384fa578f32888f1382adf0066edae;hb=7964e731496042635052c96d2046290abbec052d;hp=bd5b66c18337ec2310adab426030b05b584fe6c5;hpb=ebc1cf4a81e547c0cc239470ba76452a31fec572;p=sort-networks.git

diff --git a/README b/README
index bd5b66c..3778dde 100644
--- a/README
+++ b/README
@@ -33,6 +33,9 @@ The distribution includes the following utility programs:
     Remove an input by assuming positive or negative infinity to be applied to
     one input and "winning" or "losing" all comparisons.
 
+  * sn-info
+    Display information about a comparator network in human readable form.
+
   * sn-merge
     Combine two sort networks using the odd-even-merge network.
 
@@ -42,9 +45,16 @@ The distribution includes the following utility programs:
     way.
 
   * sn-oddevenmerge
-    Creates a odd-even-merge-sort network with a given number of inputs and
+    Create an odd-even merge network with a given number of left and right
+    inputs. The resulting network is printed to STDOUT.
+
+  * sn-oddevensort
+    Creates an odd-even mergesort network with a given number of inputs and
     prints the network to STDOUT.
 
+  * sn-pairwise
+    Create a pairwise sorting network based on the paper by Ian Parberry.
+
   * sn-shmoo
     Prints a so-called "shmoo chart" of a comparator network to STDOUT. The
     running time of this tool is exponential, roughly O(m * 2^n) where m is the