java排序

排序:

1.插入排序:

public <T extends Comparable<? super T>> void insertSort(T[] args) {
int j ;
for(int i = 0; i < args.length; i++){
// 在第i趟的时候,先把该值保存下来
T tmp = args[i];
for(j = i;j > 0 && tmp.compareTo(args[j]) < 0; j--)
args[j] = args[j - 1];
args[j] = tmp;
}
}

2.希尔排序

对于数组Integer arrs={81,94,11,96,12,35,17,95,28,58,41,75,15},k取值依次为6,3,1

[6]:
{15,94,11,58,12,35,17,95,28,96,41,75,81}

[3]: {15,12,11,17,41,28,58,94,35,81,95,75,96}

[1]: {11,12,15,17,28,35,41,58,75,81,94,95,96}

public<T extends Comparable<? super T>> void shellSort(T[] arrs){
int j;
//每次取间隔k的元素进行比较
for(int k = arrs.length / 2; k > 0; k = k >> 1){
// 从k开始一直到数组长度.
for(int i = k; i < arrs.length; i++	){
T tmp = arrs[i];
//每个元素均与其相隔k的元素比较.
for(j = i; j >= k && tmp.compareTo(arrs[j - k]) < 0; j -= k)
arrs[j] = arrs[j - k];
arrs[j] = tmp;
}
}
}