冒泡排序:{5,6,1,4,2}--> {1,2,4,5,6}
public void sort(int[] arr){ for(int i=0;i<arr.length;i++){ boolean isExchange= false; for (int j=i+1;j<arr.length;j++){ if(arr[i]>arr[j]){ int c; c = arr[i]; arr[i] = arr[j]; arr[j] = c; isExchange = true; } } if(!isExchange){ return; } } }