左神视频day01——时间复杂度，递归，归并排序，求小和问题

1. 归并排序

public class MergeTest {

    public static void MergeSort(int[] arr) {
        if (arr == null || arr.length < 2) {
            return;
        }
        mergeSort(arr, 0, arr.length - 1);
    }

    public static void mergeSort(int[] arr, int l, int r) {
        if (l == r) {
            return;
        }
        int mid = l + ((r - l) >> 1);
        mergeSort(arr, l, mid);
        mergeSort(arr, mid + 1, r);
        merge(arr, l, mid, r);
    }

    public static void merge(int[] arr, int l, int m, int r) {
        int[] help = new int[r - l + 1];
        int i = 0;
        int p1 = l;
        int p2 = m + 1;
        while (p1 <= m && p2 <= r) {
            help[i++] = arr[p1] < arr[p2] ? arr[p1++] : arr[p2++];
        }
        while (p1 <= m) {
            help[i++] = arr[p1++];
        }
        while (p2 <= r) {
            help[i++] = arr[p2++];
        }
        for (i = 0; i < help.length; i++) {
            arr[l + i] = help[i];
        }
    }

    public static void main(String[] args) {
        MergeTest a = new MergeTest();
        int[] arr = {3, 2, 5, 9, 6, 7, 8, 4, 1};
        a.MergeSort(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + ","); //1 2 3 4 5 6 7 8 9
        }
    }
}

2. 求小和问题：在一个数组中，每一个数左边比当前数小的数累加起来，叫做这个数组的小和。

public class SmallSum {

    public static int smallSum(int[] arr) {
        if (arr == null || arr.length < 2) {
            return 0;
        }
        return mergeSort(arr, 0, arr.length - 1);
    }

    public static int mergeSort(int[] arr, int l, int r) {
        if (l == r) {
            return 0;
        }
        int mid = l + ((r - l) >> 1);
        return mergeSort(arr, l, mid) + mergeSort(arr, mid + 1, r) + merge(arr, l, mid, r);
    }

    public static int merge(int[] arr, int l, int m, int r) {
        int[] help = new int[r - l + 1];
        int i = 0;
        int p1 = l;
        int p2 = m + 1;
        int res = 0;
        while (p1 <= m && p2 <= r) {
            res += arr[p1] < arr[p2] ? (r - p2 + 1) * arr[p1] : 0;
            help[i++] = arr[p1] < arr[p2] ? arr[p1++] : arr[p2++];
        }
        while (p1 <= m) {
            help[i++] = arr[p1++];
        }
        while (p2 <= r) {
            help[i++] = arr[p2++];
        }
        for (i = 0; i < help.length; i++) {
            arr[l + i] = help[i];
        }
        return res;
    }

    public static void main(String[] args) {
        SmallSum a = new SmallSum();
        int[] arr = {3, 2, 5, 9, 6, 7, 8, 4, 1};
        a.smallSum(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + ","); //1 2 3 4 5 6 7 8 9
        }
    }
}

3. 时间复杂度

• 插入、选择、冒泡 —— 时间复杂度 O(N²），额外空间复杂度 O(1)
• 归并、快速、堆 —— 时间复杂度 O(N*logN），额外空间复杂度 ：归并排序 O(N) ，快速排序 O(logN)，堆排序 O(1)

4. 递归的复杂度判断