用冒泡排序对数组元素“升序”排序,并打印排序后的数组。
图解过程:
public static void main(String[] args) {
int[] arr = {1,2,432,32,54,32,3,7,657,563,25,43,6,463,52};
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-i-1; j++) {
if (arr[j]>arr[j+1]){
int t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
}
}
}
System.out.println(Arrays.toString(arr));
}