projects / sort-networks.git / history
? search:
summary | shortlog | log | commit | commitdiff | tree
first ⋅ prev ⋅ next
data/14i-10s-51c-0.sn: Add most-efficient 14-input sorting network.
[sort-networks.git] / data /
2010-05-17 Florian Forsterdata/14i-10s-51c-0.sn: Add most-efficient 14-input... tree | commitdiff
2010-05-17 Florian ForsterAdded 16-input sorting network found by the END algorithm. tree | commitdiff
2010-05-10 Florian ForsterAdded the best known networks for 9 and 10 inputs. tree | commitdiff
2010-05-10 Florian ForsterAdded the best known networks for 13 and 16 inputs. tree | commitdiff
Evolutionary algorithm to find small sort networks.