冒泡，选择，插入

package shuzu;import java.util.Arrays;public class Demo02 {public static void main(String[] args) {//定义一个数组int [] ary = {1,2,3,3,2,4,5,5,4,3,2};//输出该数组System.out.println(Arrays.toString(ary));/** * 冒泡排序 */sort_1(ary);System.out.println(Arrays.toString(ary));/** * 选择排序 */sort_2(ary);System.out.println(Arrays.toString(ary));/** * 插入排序 */sort_3(ary);System.out.println(Arrays.toString(ary));}/** * 冒泡排序 */public static void sort_1(int [] ary){int k ;for(int i =0;i<ary.length-1;i++){for(int j = 0;j<ary.length-1;j++){if(ary[j] < ary[j+1]){ary[j] = ary[j] ^ ary[j+1];ary[j+1] = ary[j] ^ ary[j+1];ary[j] = ary[j] ^ ary[j+1];}}}}/** * 选择排序 */public static void sort_2(int [] ary){for(int i = 0; i<ary.length;i++){for(int j = 0;j<ary.length;j++){if(ary[i]<ary[j]){ary[i] = ary[i] ^ ary[j];ary[j] = ary[i] ^ ary[j];ary[i] = ary[i] ^ ary[j];}}}}/** * 插入排序 */public static void sort_3(int []ary){int k;for(int i =1;i= 0 && ary[j] < k;j-- ){ary[j+1] = ary[j];ary[j] = k;}}}}