projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d407075) | patch
Added two more efficient 14- and 15-input sorting networks.
authorFlorian Forster <octo@leeloo.lan.home.verplant.org>
Mon, 17 May 2010 09:56:11 +0000 (11:56 +0200)
committerFlorian Forster <octo@leeloo.lan.home.verplant.org>
Mon, 17 May 2010 09:56:11 +0000 (11:56 +0200)
commit2ec76f447c1411a992708817e2f09c35b89c5896
tree8829b5497143bd9a48bfa081c980fd298ef593b6tree | snapshot
parentd407075439ccb200a860b85573480617fd671685commit | diff
Added two more efficient 14- and 15-input sorting networks.

Both created from data/16i-10s-60c-0.sn by sn-evolution-cut.
data/14i-10s-51c-1.sn [new file with mode: 0644] blob
data/15i-56c-10s-1.sn [new file with mode: 0644] blob
Evolutionary algorithm to find small sort networks.