git.verplant.org Git - sort-networks.git/commit

author	Florian Forster <octo@leeloo.octo.it>
	Tue, 21 Dec 2010 10:35:12 +0000 (11:35 +0100)
committer	Florian Forster <octo@leeloo.octo.it>
	Tue, 21 Dec 2010 10:35:12 +0000 (11:35 +0100)
commit	8d745e97bdb8371c42dff7304d55511fabfa6b6c
tree	6a5a771172df3316d7a15fab2828652dcfedd3c1	tree \| snapshot
parent	aa1cdcc8164fc002497203f7354ad377f6a65624	commit \| 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.

RSS Atom