算法

1.排序:1.1 冒泡排序1.2希尔排序

1.1冒泡排序

class Demo{
	public static int[] arr={3,1,2,8,0,4,7,5,9,6};
	public static void main(String[] args){
		sop(arr);
		bubbleSort(arr);
		sop(arr);
		
	}
	//冒泡法的核心内容.
	public static void bubbleSort(int[] arr){
		for(int x=0;x<arr.length-1;x++){
			for(int y=0;y<arr.length-x-1;y++){
				if(arr[y]>arr[y+1])
					swap(y,y+1);
			}
		}
	}
	//↑↑↑↑↑
	public static void swap(int dex1 ,int dex2){
			arr[dex1]=arr[dex1]^arr[dex2];
			arr[dex2]=arr[dex1]^arr[dex2];
			arr[dex1]=arr[dex1]^arr[dex2];
		}
	public static void sop(int[] arr){
		for(int x=0;x<arr.length;x++){
			System.out.print(Integer.toString(arr[x])+"  ");
		}
			System.out.println();
	}
}