冒泡排序

package Sort;

import java.util.Arrays;

/**
 * @author lxy
 * @version 1.0
 * @date 2020/10/3 13:46
 * 测试冒泡排序
 */
public class Demo01 {
    public static void main(String[] args) {
        int[] arr= new int[]{0,2,5,3,7,1,9,5};
        //时间复杂度O(n^2)
        //需要排序的次数
        for (int i = 0; i < arr.length-1 ; i++) {
            //每次排序的个数
            for (int j = 0; j < arr.length-i-1 ; j++) {
                if (arr[j]<arr[j+1]) {
                    int sum = arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=sum;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}