排序算法之希尔排序

代码案例java public interface Sort<T> { void sort(Comparable<T>[] c); boolean greater(Comparable<T> v1, Comparable<T> v2); void exchange(Comparable<T>[] c,int i,int j); } public abstract class

>>阅读原文<<