projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 2d978b5) | patch
data/15i-56c-10s-0.sn: Add most-efficient 15-input sorting network.
authorFlorian Forster <octo@leeloo.lan.home.verplant.org>
Mon, 17 May 2010 09:49:08 +0000 (11:49 +0200)
committerFlorian Forster <octo@leeloo.lan.home.verplant.org>
Mon, 17 May 2010 09:49:08 +0000 (11:49 +0200)
commitd407075439ccb200a860b85573480617fd671685
tree68f9013e6c01ba23a16ddc28fc6986d00e1dc521tree | snapshot
parent2d978b571af8236b1ac4ab33ff64d6f7a227c1bbcommit | diff
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 [new file with mode: 0644] blob
Evolutionary algorithm to find small sort networks.