归并排序、快速排序

//归并排序
public static void mergeSort(int[] a,int n){
    mergeSortInternally(a,0,n-1);
}

public static void mergeSortInternally(int[] a, int p, int r){
    if(p >= r) return;

    int q = p + (r-p)/2;
    mergeSortInternally(a,p,q);
    mergeSortInternally(a,q+1,r);
    merge(a,p,q,r);
}

public static void merge(int[] a,int p,int q,int r){
    int i = p;
    int j = q+1;
    int k = 0;
    int[] tmp = new int[r-p+1];
    while (i<=q && j<=r){
        if(a[i] <= a[j]){
            tmp[k++] = a[i++];
        }else {
            tmp[k++] = a[j++];
        }
    }

    int start = i;
    int end = q;
    if(j <= r){
        start = j;
        end = r;
    }

    while (start <= end){
        tmp[k++] = a[start++];
    }

    for(i = 0;i<=r-p;i++){
        a[p+i] = tmp[i];
    }
}

//快速排序
public static void quickSort(int[] a,int n){
    quickSortInternally(a,0,n-1);
}

public static void quickSortInternally(int[] a,int p,int r){
    if(p >= r) return;
    int q = partition(a,p,r);
    quickSortInternally(a,p,q-1);
    quickSortInternally(a,q+1,r);
}

public static int partition(int[] a,int p,int r){
    int pivot = a[r];
    int i = p;
    for(int j = p;j<r;j++){
        if(a[j] < pivot){
            if(i == j){
                ++i;
            }else {
                int tmp = a[i];
                a[i++] = a[j];
                a[j] = tmp;
            }
        }
    }
    int tmp = a[i];
    a[i] = a[r];
    a[r] = tmp;

    return i;
}