排序算法

public class ArrayCommon2 {public static void main(String args[]) {int[] arr = new int[] { 23, 45, 34, 1, 45, 67, 12, 44, 56 };// 冒泡排序for (int i = 0; i < arr.length; i++) {// 排序次数for (int j = 0; j < arr.length - 1 - i; j++) {// 遍历元素if (arr[j] > arr[j + 1]) {int temp = arr[j];arr[j] = arr[j + 1];arr[j + 1] = temp;}}}System.out.print("冒泡排序：");for (int i = 0; i < arr.length; i++) {System.out.print(arr[i] + " ");}//直接选择排序for(int i = 0; i < arr.length; i++){for (int j = i+1; j < arr.length - 1; j++){if (arr[i] > arr[j]) {int temp = arr[i];arr[i] = arr[j];arr[j] = temp;}}}System.out.print("直接选择排序：");for (int i = 0; i < arr.length; i++) {System.out.print(arr[i] + " ");}}}

冒泡算法&直接选择排序算法