[racket] on reversing a list by way of sort

Mike Bostock's visual demonstration of why naive sorting functions are 
false friends. As he and Henglein point out, transitivity of the 
comparator is essential.

http://bost.ocks.org/mike/shuffle/compare.html

On 09/15/14 2:16 PM, Robby Findler wrote:
> Fritz Henglein has studied the problem "what is a sorting function?" 
> that touches on this kind of thing.
>
> http://www.sciencedirect.com/science/article/pii/S1567832608001094
>
>
> Robby
>
> On Monday, September 15, 2014, David Van Horn <dvanhorn at cs.umd.edu 
> <mailto:dvanhorn at cs.umd.edu>> wrote:
>
>     On 9/15/14, 4:53 PM, David Van Horn wrote:
>     > I don't think you made enough examples.
>
>     Nope - my bad.  Cute.  Awful, but cute (and there could be correct
>     implementations of sort that would break your rev).
>
>     David
>
>
>     ____________________
>       Racket Users list:
>     http://lists.racket-lang.org/users
>
>
>
> ____________________
>    Racket Users list:
>    http://lists.racket-lang.org/users