0081 插入排序简单分析

package sort;

public class InsertSorting {
    public static void insertSort(int[] nums){
        if (null == nums || nums.length < 2)
            return;
        for (int i = 0; i < nums.length; i++)
            for (int j = i; j>0; j--){
               if(nums[j] < nums[j - 1]){
                    int tmp = nums[j];
                    nums[j] = nums[j - 1];
                    nums[j - 1] = tmp;
            }
        }
    }
    //最好情况：数组已经有序，只有比较，T(n)= 1 + 2 +...+ n-1 =O(n^2)
    //最坏情况：数组逆序，做全部比较和交换，T(n)=2*(1+2+...+n-1)=O(n^2)
    //平均时间复杂度：O(n^2),空间复杂度O(1)


    public static void main(String[] args){
        int[] nums = {2,0,1,9,1,0,2,8,1,23};
        insertSort(nums);
        for (int num: nums)
            System.out.print(num+" ");
    }
}