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