From: Florian Forster <octo@leeloo.lan.home.verplant.org>
Date: Mon, 17 May 2010 09:46:44 +0000 (+0200)
Subject: data/14i-10s-51c-0.sn: Add most-efficient 14-input sorting network.
X-Git-Tag: v1.0.0~37
X-Git-Url: https://git.verplant.org/?a=commitdiff_plain;h=2d978b571af8236b1ac4ab33ff64d6f7a227c1bb;p=sort-networks.git

data/14i-10s-51c-0.sn: Add most-efficient 14-input sorting network.

Found by the sn-evolution-cut algorithm. It is as efficient as the best
known 14-input sorting network.
---

diff --git a/data/14i-10s-51c-0.sn b/data/14i-10s-51c-0.sn
new file mode 100644
index 0000000..8f9d504
--- /dev/null
+++ b/data/14i-10s-51c-0.sn
@@ -0,0 +1,64 @@
+Inputs: 14
+Comment: sn-evolution-cut (data/16i-10s-60c-1.sn)
+
+0 10
+1 4
+3 11
+5 7
+8 12
+9 13
+
+0 5
+1 6
+2 3
+4 11
+8 9
+7 10
+12 13
+
+0 8
+1 2
+3 6
+5 9
+7 12
+10 13
+
+0 1
+2 8
+3 5
+4 7
+6 9
+11 12
+
+1 3
+2 4
+5 11
+6 7
+8 10
+12 13
+
+1 2
+3 4
+6 8
+7 10
+9 12
+
+2 3
+4 5
+9 11
+12 13
+
+4 6
+5 8
+7 9
+10 11
+
+3 4
+5 6
+7 8
+9 10
+11 12
+
+6 7
+8 9
+