将插入排序算法更改为递归形式，并分析时间复杂度

public class InsertSort {
    public static void main(String[] args) {
        int[] arr = {2, 7, 5, 4, 8, 9, 0, 1, 3, 6};
        int[] newArr = sort(arr, arr.length);
        for (int x : newArr) {
            System.out.print(x + " ");
        }
    }

    private static int[] sort(int[] arr, int length) {
        int i;
        if (length == 1) {
            return arr;
        }
        sort(arr, length - 1);
        int temp = arr[length - 1];
        for (i = length - 2; i >= 0 && temp < arr[i]; i--) {
            arr[i + 1] = arr[i];
        }
        arr[i + 1] = temp;
        return arr;
    }
}

时间复杂度：O(n^2)