java冒泡排序

	int[] arr = new int[] {4,2,7,1,3,5,14};
	int guo=0;
	
	for(byte a = 0; a <= arr.length-1; a++) {
		for(byte b = a; b <= arr.length-1; b++) {
			
			if(arr[a]>arr[b]) {
				guo = arr[a];
				arr[a] = arr[b];
				arr[b] = guo;
				//遍历
    	    	System.out.print("遍历：");
    	    	for(byte c = 0; c <= arr.length-1; c++) {
    	    		System.out.print(arr[c]+",");   		
    	    	} 
    	    	System.out.print("n");
			}
			
		}
	}

从前往后两两对比
把数组大的元素向后移