import java.util.Arrays; public class mysort { public static void main(String[] args) { int[] arr = { 36, 51, 43, 12, 54, 68, 89, 53, 26, 5, 84, 9, 8, 4, 52 }; System.out.println("原数组输出"); for (int x : arr) { System.out.print(x + " "); } System.out.println(); /* * System.out.println("冒泡排序结果:"); buddleSort(arr); System.out.println(); * System.out.println("选择排序结果:"); selecttionSort(arr);System.out.println(); */ System.out.println("java自带排序方法:"); Arrays.sort(arr); for (int x : arr) { System.out.print(x + " "); } } // 冒泡排序方法 public static void buddleSort(int[] arr) { 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 a = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = a; } } } for (int x : arr) { System.out.print(x + " "); } } // 选择排序方法 public static void selecttionSort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { int k = i; for (int j = k + 1; j < arr.length; j++) { if (arr[j] < arr[k]) { k = j; } } if (i != k) { int temp = arr[i]; arr[i] = arr[k]; arr[k] = temp; } } for (int x : arr) { System.out.print(x + " "); } } }