
原理
1、数组两两比较,较大的放右边2、每次循环完,无序数组长度-1
public static void bubbleSort(int[] arr){//[4,1,2,4,6,3,8,9,3]for (int end = arr.length-1; end >0 ; end--) {for (int i = 0; i <end ; i++) {if(arr[i]>arr[i+1]){swap(arr,i,i+1);}}}}public static void swap(int arr[], int left, int right){if(arr.length==0 || arr.length-1<left || arr.length-1<right){return;}int tmp = arr[left];arr[left] = arr[right];arr[right] = tmp;}public static void main(String[] args) {int[] arr = new int[]{4,1,2,4,6,3,8,9,3};bubbleSort(arr);System.out.println(Arrays.toString(arr));}
