public static void bubbleSort() { int temp = 0; for (int i = randomNumbers.length - 1; i > 0; i--) { for (int j = 1; j <= i; j++) { if (randomNumbers[j - 1] > randomNumbers[j]) { temp = randomNumbers[j - 1]; randomNumbers[j - 1] = randomNumbers[j]; randomNumbers[j] = temp; } } } System.out.println(Arrays.toString(randomNumbers)); } public static void selectSort() { for (int i = 0; i < randomNumbers.length; i++) { int min = i; for (int j = i + 1; j < randomNumbers.length; j++) { if (randomNumbers[min] > randomNumbers[j]) { min = j; } } if (i < randomNumbers.length - 1) { int temp = randomNumbers[min]; randomNumbers[min] = randomNumbers[i]; randomNumbers[i] = temp; } } System.out.println(Arrays.toString(randomNumbers)); } public static void insertionSort() { for (int i = 0; i < randomNumbers.length - 1; i++) { // i就是有序数列的最后一个位置 // k要插入有序的数据位置 int j = i + 1;// j就是无序数列的第一个位置 if (randomNumbers[i] > randomNumbers[j]) { for (int k = j; k > 0 && randomNumbers[k - 1] > randomNumbers[k]; k--) { int temp = randomNumbers[k]; randomNumbers[k] = randomNumbers[k - 1]; randomNumbers[k - 1] = temp; } } } System.out.println(Arrays.toString(randomNumbers)); }
转载于:https://www.cnblogs.com/yinqi/archive/2012/12/05/2802475.html
