Quick sort in Solidity for Ethereum network

QuickSort.sol

pragma solidity ^0.4.18;

contract QuickSort {
    
    function sort(uint[] data) public constant returns(uint[]) {
       quickSort(data, int(0), int(data.length - 1));
       return data;
    }
    
    function quickSort(uint[] memory arr, int left, int right) internal{
        int i = left;
        int j = right;
        if(i==j) return;
        uint pivot = arr[uint(left + (right - left) / 2)];
        while (i <= j) {
            while (arr[uint(i)] < pivot) i++;
            while (pivot < arr[uint(j)]) j--;
            if (i <= j) {
                (arr[uint(i)], arr[uint(j)]) = (arr[uint(j)], arr[uint(i)]);
                i++;
                j--;
            }
        }
        if (left < j)
            quickSort(arr, left, j);
        if (i < right)
            quickSort(arr, i, right);
    }
}

Is there any efficient way to sort apart from quicksort?

@Ipseeta there are some efficient sorting algorithms but i doubt Solidity implementations of such.

@Ipseeta you can refer to this, https://gist.github.com/sdelvalle57/f5f65a31150ea9321f081630b416ed99

@sdelvalle57 seriously bubble sort O(n*n) over quick sort O(nlogn) ?
merge sort, i can still consider.

@0xAshish merge sort uses a lot of extra memory. Will that cost a lot of gas.

Is there any descending implementation of quicksort in solidity?