From d407075439ccb200a860b85573480617fd671685 Mon Sep 17 00:00:00 2001 From: Florian Forster Date: Mon, 17 May 2010 11:49:08 +0200 Subject: [PATCH] data/15i-56c-10s-0.sn: Add most-efficient 15-input sorting network. Found by the sn-evolution-cut algorithm. It is as efficient as the best known 15-input sorting network. --- data/15i-56c-10s-0.sn | 69 +++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 69 insertions(+) create mode 100644 data/15i-56c-10s-0.sn diff --git a/data/15i-56c-10s-0.sn b/data/15i-56c-10s-0.sn new file mode 100644 index 0000000..b4ae0bb --- /dev/null +++ b/data/15i-56c-10s-0.sn @@ -0,0 +1,69 @@ +Inputs: 15 +Comment: sn-evolution-cut (data/16i-10s-60c-1.sn) + +0 10 +2 11 +3 7 +5 12 +4 6 +8 14 +9 13 + +0 5 +1 4 +2 3 +8 9 +10 12 +7 11 +13 14 + +0 8 +1 2 +3 4 +6 7 +5 9 +10 13 +12 14 + +0 1 +2 8 +3 5 +6 10 +4 9 +11 12 +7 13 + +1 3 +2 6 +5 7 +4 10 +8 11 +9 12 +13 14 + +1 2 +3 6 +4 8 +10 11 +9 13 +12 14 + +2 3 +5 6 +7 9 +12 13 + +4 5 +6 8 +7 10 +9 11 + +3 4 +5 6 +7 8 +9 10 +11 12 + +6 7 +8 9 + -- 2.11.0