冒泡排序的时间复杂度为O(n^2)

package com.qianfeng.homework;import java.util.Arrays;public class BubbleSort {public static void bubbleSort(int[] nums){for (int i = 0; i < nums.length-1; i++) {for (int j = 0; j < nums.length-i-1; j++) {if(nums[j] > nums[j+1]){int temp = nums[j];nums[j] = nums[j+1];nums[j+1] = temp;}}}}public static void main(String[] args) {int[] nums = new int[]{ 2,5,6,8,5,2,9,6};BubbleSort.bubbleSort(nums);System.out.println(Arrays.toString(nums));}
}