//冒泡排序 int[] arr = {2,6,9,1,3,5,8}; for (int i = 0; i < arr.length - 1; i++) { for (int j = 0; j < arr.length -1 -i; j++) { if(arr[j] > arr[j+1]) { int temp = arr[j+1]; arr[j+1] = arr[j]; arr[j] = temp; } } } System.out.println(Arrays.toString(arr)); //选择排序 int[] arr = {2,6,9,1,3,5,8}; for (int i = 0; i < arr.length-1; i++) { for (int j = i+1; j < arr.length; j++) { if(arr[i] < arr[j]) { int temp = arr[j]; arr[j] = arr[i]; arr[i] = temp; } } } System.out.println(Arrays.toString(arr)); |