This method returns a selector giving the sorted order; it does not return the sorted array itself. To get the sorted array, use the McObject.SelectedValues method (see Example).
For Single and Double source arrays, missing values (see McMissingSingleValue, McMissingDoubleValue and McIsMissingValue) are considered to be as small a number as possible, so they will all be clustered at the front of the sorted order for ascending sorts and at the end for descending sorts.
In both descending or ascending sorts, the original relative ordering is maintained for sorted elements with identical values.
The sorting algorithm used is a Quicksort. The sorting time is proportional to some N*log(N) on the average, but may be proportional to N*N in the worst case.