Hi guys, I have just implemented a so-called bitonic sort in VIFF. This is a sorting algorithm which is data-independent -- the comparisons are fixed beforehand. This makes it good for something like VIFF, I hope.
The code is here: http://hg.viff.dk/viff/file/tip/apps/sort.py#l113 and you should compare it to the Java code found here: http://iti.fh-flensburg.de/lang/algorithmen/sortieren/bitonic/oddn.htm#section4 It does 466 comparisons to sort 52 numbers (32-bit) and it takes about 4 minutes both share and sort the numbers on thyra{01,02,03} on DAIMI. -- Martin Geisler
pgpFWVfLTQQKY.pgp
Description: PGP signature
_______________________________________________ viff-devel mailing list (http://viff.dk/) viff-devel@viff.dk http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
