冒泡排序与选择排序

package Test;import java.util.Arrays;/** * @author rainbow */public final class TestSF {public static void main(String[] args) {int[] arr = new int[] { 1, 4, 5, 6, 8, 5, 3, 2, 6 };// 冒泡排序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]) {arr[j] = arr[j] ^ arr[j + 1];arr[j + 1] = arr[j + 1] ^ arr[j];arr[j] = arr[j] ^ arr[j + 1];}}}System.out.println(Arrays.toString(arr));// 选择排序for (int i = 0; i < arr.length - 1; i++) {for (int j = i + 1; j < arr.length; j++) {if (arr[i] < arr[j]) {arr[i] = (arr[i] + arr[j]) - (arr[j] = arr[i]);}}}System.out.println(Arrays.toString(arr));}}