java常见排序速记

冒择路（入）兮（希尔）快归堆

冒泡，选择，插入，希尔，快速，归并，堆

public static void main(String[] args) {
		
		int []a={5,1,3,9,7};
		for (int i = a.length; i>0; i--) {
			for (int j = 0; j < i-1; j++) {
				//12   10
				if (a[j] > a[j+1]) {
					a[j]=a[j]-a[j+1];  //2  10
					a[j+1]=a[j+1]+a[j]; //12  2
					a[j]=a[j+1]-a[j];
				}
			}
		}
		
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i]+"  ");
		}
		System.out.println();
		
		int x=10; int y=12; 
		x=y-x; 
		y=y-x; 
		x=x+y; 
		System.out.println("x:"+x);
		System.out.println("y:"+y);
	}