数据结构--排序算法

快速排序

public class QuickSort {
    public static void main(String[] args) {
        int[] arr = {10,7,2,4,7,62,3,4,2,1,8,9,19};
        quickSort(arr, 0, arr.length-1);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }

    private static void quickSort(int[] arr, int left, int right) {
        if(left >= right) return;//子数组长度为1，终止递归
        int i = left, j = right;//以最左边的数为基准值
        while (i < j){
            while(i < j && arr[j] >= arr[left]) j--;//从右边找小于基准值的数
            while(i < j && arr[i] <= arr[left]) i++;//从左边找大于基准值的数
            swap(arr, i, j);
        }
        swap(arr,left,i);
        quickSort(arr, left, i-1);
        quickSort(arr, i+1, right);
    }

    private static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
}

归并排序

public class MergeSort {
    public static void main(String[] args) {
        int arr[] = { 8, 4, 5, 7, 1, 3, 6, 2 };
        int tmp[] = new int[arr.length];//需要n大小的额外空间
        mergeSort(arr,0,arr.length-1,tmp);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }

    }
    private static void mergeSort(int[] arr, int left, int right,int[] tmp){
        if(left < right){
            int mid = (left + right) / 2;
            mergeSort(arr, left, mid, tmp);//左右两边分别归并排序
            mergeSort(arr, mid+1, right, tmp);
            merge(arr, left, mid, right, tmp);//合并
        }
    }

    private static void merge(int[] arr, int left, int mid, int right, int[] tmp) {
        int i = left, j = mid + 1, t = 0;//临时指针
        while (i <= mid+1 && j <= right){
            if(arr[i] < arr[j]){//将两边的数从小到大放入临时数组
                tmp[t++] = arr[i++];
            }else{
                tmp[t++] = arr[j++];
            }
        }

        while (i <= mid){//若右边放完了，则将左边剩余数一次添加到临时数组尾部
            tmp[t++] = arr[i++];
        }

        while (j <= right){//若左边放完了，则将右边剩余数一次添加到临时数组尾部
            tmp[t++] = arr[j++];
        }

        t = 0;
        while (left <= right){
            arr[left++] = tmp[t++];//将排好序的临时数组复制到原数组
        }
    }

}