冒泡排序
冒泡排序的核心: 拿着左边数字和右边的比对,当左边 > 右边的时候,交换位置
1.写法1
代码如下(示例):
public class Test01{
public static void main(String[] args){
//定义一个int类型数组
int[] arr = {3,2,9,5,13,74,52,6};
//冒泡排序
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;
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
//遍历
for (int i = 0; i < arr.length; i++ ){
System.out.println(arr[i]);
}
}
}
2.写法2
代码如下(示例):
public class Test02{
public static void main(String[] args){
int[] arr = {1,3,45,143,452,15,7,65};
//冒泡排序
for (int i = arr.length - 1; i > 0 ;i-- ){
for (int j = 0;j < i ;j++ ){
if (arr[j] > arr[j + 1]){
int temp;
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
//遍历
for (int i = 0;i < arr.length ;i++ ){
System.out.println(arr[i]);
}
}
}