Is Sort( delegate ) stable?

@William Yu , and others, I was wondering if sorting with a Delegate produces a stable sort, and if that can be documented?

For those that don’t know, when two values are equal, their relative positions are guaranteed to be maintained when a stable sort is complete. If not stable, the order of the equal values relative to each other might change.

its documented as being a radix sort which is stable

Sort is documented as using Radix. I assumed the Delegate variant would have to be a QuickSort or similar. I don’t see how you’d do a Radix sort with that result, but I haven’t explored it either.

me either
radix usually needs to know key length or something

there are ways to make quicksort stable

Maybe @William Yu, @Travis Hill, or someone can see exactly what happens with sort when you do use a delegate ?