算法-快速排序

private List<Map> QuickSort(List<Map> list, String sortKey, int left,int right)
{
    return quick_sort(list,sortKey,left,right);
}

private List<Map> quick_sort(List<Map> list, String sortKey, int left,int right)
{
    if(left < right)
    {
        Map key = list.get(left);
        int low = left;
        int high = right;
        while(low < high)
        {
            while(low < high && list.get(high).get(sortKey) >= key.get(sortKey))
            {
                high--;
            }
            list.set(low,list.get(high));
            while(low < high && list.get(low).get(sortKey) <= key.get(sortKey))
            {
                low++;
            }
            list.set(high,list.get(low));
        }
        list.set(low,key);
        List<Map> listSortLeft = quick_sort(list,sortKey,left,low-1);
        List<Map> listSortRight = quick_sort(listSortLeft ,sortKey,low+1,right);
        return listSortRight;
    }
    return list;
}