.NET (Core and Framework)

private class SorterObjectArray
{
    private Object[] keys;
    private Object[] items;
    private IComparer comparer;


    public SorterObjectArray(Object[] keys, Object[] items, IComparer comparer) {
        if (comparer == null) comparer = Comparer.Default;
        this.keys = keys;
        this.items = items;
        this.comparer = comparer;
    }

    public virtual void QuickSort(int left, int right) {
        // Can use the much faster jit helpers for array access.
        do {
            int i = left;
            int j = right;
            Object x = keys[(i + j) >> 1];
            do {
                // Add a try block here to detect IComparers (or their
                // underlying IComparables, etc) that are bogus.
                try {
                    while (comparer.Compare(keys[i], x) < 0) i++;
                    while (comparer.Compare(x, keys[j]) < 0) j--;
                }
                catch (IndexOutOfRangeException) {
                    throw new ArgumentException(String.Format(Environment.GetResourceString("Arg_BogusIComparer"), x, x.GetType().Name, comparer));
                }
                catch (Exception e) {
                    throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_IComparerFailed"), e);
                }
                BCLDebug.Assert(i>=left && j<=right, "(i>=left && j<=right)  Sort failed - Is your IComparer bogus?");
                if (i > j) break;
                if (i < j) {
                    Object key = keys[i];
                    keys[i] = keys[j];
                    keys[j] = key;
                    if (items != null) {
                        Object item = items[i];
                        items[i] = items[j];
                        items[j] = item;
                    }
                }
                i++;
                j--;
            } while (i <= j);
            if (j - left <= right - i) {
                if (left < j) QuickSort(left, j);
                left = i;
            }
            else {
                if (i < right) QuickSort(i, right);
                right = j;
            }
        } while (left < right);
    }
}