X-Git-Url: https://git.octo.it/?p=sort-networks.git;a=blobdiff_plain;f=README;h=3778ddea4f384fa578f32888f1382adf0066edae;hp=86f7733bec426b0b375d4ddc5089b05b3d1024fa;hb=2b64b183834075911f9e53a6f0132d116bf45a76;hpb=5c43c25325b3a869d64c013b7ba02d1d28eb9ec6

diff --git a/README b/README
index 86f7733..3778dde 100644
--- a/README
+++ b/README
@@ -45,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