排-序-算-法

几个常见的排序算法
1.堆排序

public class 堆排序 {

    public static void main(String[] args) {
        int[] arr= new int[30];
        Random r = new Random();
        for (int i = 0; i < arr.length; i++) {
            arr[i] = r.nextInt(100);
        }
        System.out.println(Arrays.toString(arr));
        heapSort(arr);
        System.out.println(Arrays.toString(arr));
    }
    public static void heapSort(int[] arr) {
        //1.构建一个大顶堆
        for (int i = arr.length / 2 - 1; i >= 0; i--) {
            adjustHeap(arr,i,arr.length);
        }
        //2.调整堆结构+交换堆顶元素与末尾元素
        for(int j=arr.length-1;j>0;j--){
            swap(arr,0,j);
            adjustHeap(arr,0,j);
        }
    }

    /**
     * 重点代码
     */
    public  static void adjustHeap(int[] arr, int i, int length) {
        int tmp = arr[i];//先取出当前元素i
        for(int k=2*i+1;k<length;k=i*2+1){//从i结点的左子结点开始，也就是2i+1处开始
            if(k+1<length && arr[k+1]>arr[k]){//如果左子结点小于右子结点，k指向右子结点
                k++;
            }
            if(arr[k]>tmp){//如果子节点大于父节点，将子节点值赋给父节点（不用进行交换）
                arr[i] = arr[k];
                i=k; //表示进行调整的下标
            }else{
                break;
            }
        }
        arr[i] = tmp;
    }

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

快排

public class Quick {
    public static void main(String[] args) {
        int[] arr= new int[30];
        Random r = new Random();
        for (int i = 0; i < arr.length; i++) {
            arr[i] = r.nextInt(100);
        }
        System.out.println(Arrays.toString(arr));
        quickSort(arr,0,arr.length-1);
        System.out.println(Arrays.toString(arr));

    }

    public static void quickSort(int[] nums, int left, int right) {
        if (left >= right) return;
        int tmp = nums[left];
        int l = left, r = right;
        while (l < r) {
            while (l < r && nums[r] <= tmp) r--;
            while (l < r && nums[l] >= tmp) l++;
            int t = nums[l];
            nums[l] = nums[r];
            nums[r] = t;
        }
        nums[left] = nums[l];
        nums[l] = tmp;
        quickSort(nums,left,l-1);
        quickSort(nums,l+1,right);
    }
}