一、冒泡排序
原理:
代码:
int[]arr={
24,69,80,57,13};
//比较轮次
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;
}
}
System.out.println(Arrays.toString(arr));
}
//运行结果:
/*
*[24, 69, 57, 13, 80]
[24, 57, 13, 69, 80]
[24, 13, 57, 69, 80]
[13, 24, 57, 69, 80]
*/
二、.选择排序
原理:
代码:
int[]arr={
24,69,80,57,13};
for (int i = 0; i < arr.length-1; i++) {
for