一、冒泡排序
import java.lang.reflect.Array;
import java.util.Arrays;
/**
* 冒泡排序代码演示
*/
public class BubbleSort {
public static void main(String[] args) {
int[] numArray = {16,25,9,90,23};
int temp;
//外层循环控制轮数
for (int i = 0; i < numArray.length; i++) {
//内层循环控制次数
//数组-i-1:-i是因为次数正好等于轮数减数组长度,-1是因为j是从0开始的
for (int j = 0; j < (numArray.length -i -1); j++) {
//交换位置进行对比(改为小于号的话就是从大到小排)
if (numArray[j] > numArray[j + 1]) {
temp = numArray[j];
numArray[j] = numArray[j + 1];
numArray[j + 1] = temp;
}
}
}
//输出排序后的数组
System.out.println(Arrays.toString(numArray));
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/bb6039023383862f6a6d95400473d5b0.png)
选择排序
import java.lang.reflect.Array;
import java.util.Arrays;
/**
* 选择排序代码演示
*/
public class SelectSorting {
public static void main(String[] args) {
int[] numArray = {16,25,9,90,23};
int temp;
//外层循环控制轮数
for (int i = 0; i < (numArray.length - 1); i++) {
//内层循环控制次数
for (int j = i + 1; j < numArray.length; j++) {
//交换位置进行对比
if (numArray[j] < numArray[i]) {
temp = numArray[i];
numArray[i] = numArray[j];
numArray[j] = temp;
}
}
}
//输出排序后的数组
System.out.println(Arrays.toString(numArray));
}
}
二、Arrays类常用方法
![](https://i-blog.csdnimg.cn/blog_migrate/fce77e5007f8d3f7f0e5200120909e98.png)
三、二维数组
![](https://i-blog.csdnimg.cn/blog_migrate/f75423c1f672f61d59d82ddc33fb5164.png)
四、总结
![](https://i-blog.csdnimg.cn/blog_migrate/32602d1b8708a5983c5ec80dd5e037f3.png)