Is the sorting algorithm used by .NET's `Array.Sort()` method a stable algorithm?

Question

Is the sorting algorithm used by .NET's Array.Sort() method a stable algorithm?

Answer 1

From MSDN:

This method uses the QuickSort algorithm. This implementation performs an unstable sort; that is, if two elements are equal, their order might not be preserved. In contrast, a stable sort preserves the order of elements that are equal.

Answer 2

No, it isn't:

This method uses the QuickSort algorithm. This implementation performs an unstable sort

Answer 3

As other answers have stated, Array.Sort isn't stable. However, the LINQ OrderBy methods (and OrderByDescending etc) are stable, which can be very useful.