import java.util.Arrays;
public class Ch1_2 {
public static void main(String[] args) {
// 打印一维数组:Arrays.toString(array),打印多维数组:Arrays.deepToString(array)
System.out.println("simpleSelect sort:"+ Arrays.toString(simpleSelectSort(new int[]{2,5,2,5,3,67,14,25,13,7,10}))+"\n");
System.out.println("insert sort:"+ Arrays.toString(insertSort(new int[]{2,5,2,5,3,67,14,25,13,7,10}))+"\n");
System.out.println("bubble sort:"+ Arrays.toString(bubbleSort(new int[]{2,5,2,5,3,67,14,25,13,7,10})));
}
// 简单选择排序方法,每次选择最小值排在待排数组的首位,直到待排数组为空
public static int[] simpleSelectSort(int[] array) {
int m = array.length;
for (int i=0;i<m-1;i++) {
int min = i;
for (int j=i+1;j<m;j++) {
if (array[j]<array[min]) {
min = j;
}
}
int q = array[min];
array[min] = array[i];
array[i] = q;
System.out.println("第"+(i+1)+"趟:"+Arrays.toString(array));
}
return array;
}
// 插入排序方法,每次选择一个临近末尾值排入已排序的数组中
public static int[] insertSort(int[] array) {
int i, j, t = 0;
for (i = 1; i < array.length; i++) {
t = array[i];
for (j = i - 1; j >= 0 && t < array[j]; j--)
array[j + 1] = array[j];
array[j + 1] = t;
System.out.println("第"+(i)+"趟:"+Arrays.toString(array));
}
return array;
}
// 冒泡排序方法,两两比较,将最大值交换至末尾,直到待排数组为0
public static int[] bubbleSort(int[] array) {
int m = array.length;
for (int i=0;i<m-1;i++) {
for (int j=0;j<m-i-1;j++) {
if (array[j]>array[j+1]) {
int q = array[j];
array[j] = array[j+1];
array[j+1] = q;
}
}
System.out.println("第"+(i)+"趟:"+Arrays.toString(array));
}
return array;
}
}