[viff-devel] Bitonic sort

[Martin Geisler]

Martin Geisler <mg at daimi.au.dk> writes:

> 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.

In case nobody has noticed, I wanted to see how long it would take to
sort 52 numbers since doing so would give me a way to shuffle a deck
of cards: assign a random number to each card and sort the random
numbers. If there are no collisions in the random numbers you will get
back a nicely shuffled deck.

I began looking at card shuffling because I want to make a small
tutorial for VIFF, something that will explain how to make a program.
And for that I figured that some card game would be cool. I don't know
which game yet, so let let me know if you have any good idea!

-- 
Martin Geisler
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 188 bytes
Desc: not available
URL: <http://lists.viff.dk/pipermail/viff-devel-viff.dk/attachments/20080809/de32f671/attachment.pgp>