projects / sort-networks.git / commitdiff
? search:
summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (from: 2d978b5)
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)
Found by the sn-evolution-cut algorithm. It is as efficient as the best
known 14-input sorting network.


No differences found
Evolutionary algorithm to find small sort networks.