projects / sort-networks.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(initial) | patch
Imported the initial C files that make up a decent sorting network toolkit already.
authorFlorian Forster <octo@huhu.verplant.org>
Fri, 1 Feb 2008 15:52:55 +0000 (16:52 +0100)
committerFlorian Forster <octo@huhu.verplant.org>
Fri, 1 Feb 2008 15:52:55 +0000 (16:52 +0100)
commit02dd5a8e9890f7b16b950db238eeff42a57e9142
treed0639c1e4836e39ea84ac2dbb6392b60e0a1db51tree | snapshot
Imported the initial C files that make up a decent sorting network toolkit already.

The files built up to know are:
- sn-cut:   Does a min/max cut on a given input.
- sn-merge: Merges two networks (files) by appending a bitonic merge.
- sn-show:  Pretty-prints a network to stdout.
src/Makefile [new file with mode: 0644] blob
src/sn-cut.c [new file with mode: 0644] blob
src/sn-merge.c [new file with mode: 0644] blob
src/sn-show.c [new file with mode: 0644] blob
src/sn_comparator.c [new file with mode: 0644] blob
src/sn_comparator.h [new file with mode: 0644] blob
src/sn_network.c [new file with mode: 0644] blob
src/sn_network.h [new file with mode: 0644] blob
src/sn_stage.c [new file with mode: 0644] blob
src/sn_stage.h [new file with mode: 0644] blob
Evolutionary algorithm to find small sort networks.