选择排序比较的是元素与它后面索引的元素,冒泡排序比较的是相邻索引的元素,代码如下
package cn.zxj.com;
public class Demo {
public static void main(String[] args) {
int[] arr = {1, 3, 5, 2, 4, 0};
//选择排序
//selectOrder(arr);
//冒泡排序
bubblingOrder(arr);
//打印
showArray(arr);
}
private static void bubblingOrder(int[] arr) {
if (arr == null || arr.length <= 1) {
return;
}
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 temp;
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
public static void showArray(int[] arr) {
if (arr == null || arr.length == 0) {
return;
}
for (int i = 0; i < arr.length; i++) {
if (i == 0) {
System.out.print("{" + arr[i] + ",");
} else if (i == arr.length - 1) {
System.out.println(arr[i] + "}");
} else {
System.out.print(arr[i] + ",");
}
}
}
public static void selectOrder(int[] arr) {
if (arr == null || arr.length <= 1) {
return;
}
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j <= arr.length - 1; j++) {
if (arr[i] > arr[j]) {
int temp;
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
}