冒泡排序。

public class aaa {
	public static void main(String[] args) {
		int count=0;
		int[] arr = {4,8,2,9,43,65,2};
		
		 for(int i = arr.length-1;i > 0;i--) {
			 for(int j = 0;j < i;j++) {
				 //Despite exchange happen or not,comparison times plus 1
				 count++;
				 if(arr[j]>arr[j+1]) {
					 int tmp = arr[j];
					 arr[j] = arr[j+1];
					 arr[j+1]=tmp;
				 }
			 }
		 }
		
		for(int i = arr.length-1;i>=0;i--) {
			System.out.println(arr[i]);
		}
		
		System.out.print("comparison count"+count);
	}
}