数组升序排序
冒泡法:
/**
* 冒泡法:数组升序排序
*/
public class test1 {
public static void main(String[] args) {
int[] arr = {1, 8, 20, 10, 6, 8, 3, 5};
for (int i = 0; i <= arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i <= arr.length - 1; i++) {
System.out.print(arr[i] + "\t");
}
}
}
输出结果:1 3 5 6 8 8 10 20