[plt-scheme] stable sort

I'm not convinced that the code that Doug posted deals with reflexive 
versus irreflexive comparators correctly.  I haven't taken the time to 
come up with an example failure case (or convince myself that I am 
wrong), but I would take some time to check this out before employing 
this solution in general.

But I do agree that the basic idea (of passing the original indices 
along during the sort) is sound.

-Felix

On Nov 20, 2004, at 12:21 PM, Shriram Krishnamurthi wrote:

>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>
> Thanks, Doug.  That's very helpful.  To give credit, Erik Hilsdale
> pointed out the same solution to me in person.
>
> Shriram