Ivan Bjerre Damgaard [EMAIL PROTECTED] writes:
Martin Geisler [EMAIL PROTECTED] writes:
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
Quoting Martin Geisler [EMAIL PROTECTED]:
Martin Geisler [EMAIL PROTECTED] 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
Martin Geisler [EMAIL PROTECTED] 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
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
