projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: aa1cdcc) | patch
Implement the bitonic sort in src/sn_network.c.
authorFlorian Forster <octo@leeloo.octo.it>
Tue, 21 Dec 2010 10:35:12 +0000 (11:35 +0100)
committerFlorian Forster <octo@leeloo.octo.it>
Tue, 21 Dec 2010 10:35:12 +0000 (11:35 +0100)
commit8d745e97bdb8371c42dff7304d55511fabfa6b6c
tree6a5a771172df3316d7a15fab2828652dcfedd3c1tree | snapshot
parentaa1cdcc8164fc002497203f7354ad377f6a65624commit | diff
Implement the bitonic sort in src/sn_network.c.

The new implementation can handle input numbers which are not a power of
two. Also sn-bitonicmerge has been added which works analogously to
sn-oddevenmerge.
README diff | blob | history
src/Makefile.am diff | blob | history
src/sn-bitonicmerge.c [new file with mode: 0644] blob
src/sn-bitonicsort.c diff | blob | history
src/sn_network.c diff | blob | history
src/sn_network.h diff | blob | history
Evolutionary algorithm to find small sort networks.