projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 76c8993) | patch
src/sn_network.c: Implement shifting when using the bitonic merge.
authorFlorian Forster <octo@leeloo.lan.home.verplant.org>
Thu, 20 Nov 2008 08:58:47 +0000 (09:58 +0100)
committerFlorian Forster <octo@leeloo.lan.home.verplant.org>
Thu, 20 Nov 2008 08:58:47 +0000 (09:58 +0100)
commit1de228eb46552e2cc4555ac5a0c4adf75a8fc5db
tree0cb0675d5e590377e7ab2d70f5e294f7e2b774d9tree | snapshot
parent76c8993c0e5a4cab6a63d838cc3653c4e5ef82bfcommit | diff
src/sn_network.c: Implement shifting when using the bitonic merge.

Before adding the bitonic merger to a concatenated network, shift it by
a random amount of inputs. Because the merger is *bitonic* it'll still
be able to merge the result correctly.
src/sn_network.c diff | blob | history
Evolutionary algorithm to find small sort networks.