java排序演算法示例
阿新 • • 發佈:2019-01-22
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] + " "); } }