[racket] on reversing a list by way of sort

On 2014-09-15 21:24:53 -0700, Eric Dobson wrote:
> This is different than linked algorithm. This one assigns a random
> number from [0,1) to each element where the linked algorithm assigns a
> random pairwise ordering to each comparison.
>
> I don't think there is anything wrong from a correctness standpoint on
> the stdlib's algorithm.

Ah, you're right. I actually tried visualizing Racket's shuffle using
picts and didn't notice any streaks so I was puzzled. That explains it.

Cheers,
Asumu