考察点：冒泡排序
importjava.util.Comparator; public interface Sorter { public interface Sorter { public <T extends Comparable<T>> void sort(T[] list); public <T> void sort(T[] list, Comparator<T> comp); }import java.util.Comparator; public class BubbleSorter implements Sorter { @Override public <T extends Comparable<T>> void sort(T[] list) { boolean swapped = true; for (int i = 1, len = list.length; i< len && swapped; ++i) { swapped =false; for (int j =0; j < len - i; ++j) { if (list[j].compareTo(list[j + 1]) > 0) { T temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; swapped = true; } } } } @Override public <T> void sort(T[] list, Comparator<T>comp) { boolean swapped = true; for (int i = 1, len = list.length; i< len && swapped; ++i) { swapped =false; for (int j =0; j < len - i; ++j) { if (comp.compare(list[j], list[j + 1]) > 0) { T temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; swapped = true; } } }
