public class sort {
public static void main(String args[]) {
int[] array = new int[12];
int k = 0;
System.out.print("排列前打印:");
for (int i = 0; i < array.length; i++) {
array[i] = (int) Math.ceil(Math.random() * 100);
System.out.print(array[i] + " ");
}
System.out.println();
System.out.print("排列后打印:");
selectSort(array);
}
public static void selectSort(int[] array) {
for (int x = 0; x < array.length - 1; x++)
for (int y = x + 1; y < array.length; y++)
if (array[x] > array[y]) {
int temp = array[x];
array[x] = array[y];
array[y] = temp;
}
for (int i = 0; i < array.length; i++)
System.out.print(array[i] + " ");
}
}
java排序算法示例
最新推荐文章于 2023-02-27 12:53:03 发布