2.1.2 Selection Sort
我懶得寫了, 直接上code, 有空再補內文.
package idv.carl.sorting.selectionsort;
/**
* @author Carl Lu
*/
public class SelectionSort {
private static void swap(int[] input, int i, int j) {
int tmp = input[i];
input[i] = input[j];
input[j] = tmp;
}
public static int[] sortDesc(int[] input) {
for (int i = 0; i < input.length - 1; i++) {
for (int j = i + 1; j < input.length; j++) {
if (input[i] < input[j]) {
swap(input, i, j);
}
}
}
return input;
}
public static int[] sortAsc(int[] input) {
for (int i = 0; i < input.length - 1; i++) {
for (int j = i + 1; j < input.length; j++) {
if (input[i] > input[j]) {
swap(input, i, j);
}
}
}
return input;
}
}原始碼點我
Unit test:
原始碼點我
Last updated
Was this helpful?