Array.Sort Method (Array)
Assembly: mscorlib (in mscorlib.dll)
Each element of array must implement the IComparable interface to be capable of comparisons with every other element in array.
If the sort is not successfully completed, the results are undefined.
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.
On average, this method is an O(n log n) operation, where n is the Length of array; in the worst case it is an O(n ^ 2) operation.
For a list of the operating systems and browsers that are supported by Silverlight, see Supported Operating Systems and Browsers.