java算法排序之冒泡排序

package 十大排序; /* 时间复杂度: O(N^2) 空间复杂度: O(1) 稳定性：稳定 */ public class 冒泡排序 { public static void main(String[] args) { int [] arr ={9,8,7,6,5,4,3,2,1}; sort(arr); for (int i = 0; i < arr.length; i++) { System.out.print(arr[i]+" "); } } private static void sort( int [] arr){ if (arr ==null || arr.length==0){ return; } 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 temp =arr[j]; arr[j] = arr[j+1]; arr[j+1] =temp; } } } } }