插入排序之希尔排序Java实现
package com.mike.sort;
import java.util.Arrays;
public class ShellSort {
/*
* 希尔排序
*/
public static void shellSort(DataWrap[] data){
int h=1;
while(h<data.length/3){
h=h*3+1;
}
while(h>0){
for (int i = h; i < data.length; i++) {
DataWrap temp=data[i];
if (data[i].compareTo(data[i-h])<0) {
int j=i-h;
for (; j>=0 && data[j].compareTo(temp)>0; j-=h) {
data[j+h]=data[j];
}
data[j+h]=temp;
}
}
h=(h-1)/3;
}
}
public static void main(String[] args) {
DataWrap[] dataWraps={
new DataWrap(21,""),
new DataWrap(31,""),
new DataWrap(2,""),
new DataWrap(2338,"*"),
new DataWrap(2122,""),
new DataWrap(22,""),
new DataWrap(55,""),
new DataWrap(134,""),
new DataWrap(24000,"")
};
System.out.println("排序之前:"+Arrays.toString(dataWraps));
shellSort(dataWraps);
System.out.println("排序之后:"+Arrays.toString(dataWraps));
}
}
/*
*定义一个数据包装类
*/
class DataWrap implements Comparable<DataWrap>{
int data;
String flag;
public DataWrap() {
// TODO Auto-generated constructor stub
}
public DataWrap(int data,String flag) {
this.data=data;
this.flag=flag;
}
@Override
public String toString(){
return data+flag;
}
@Override
public int compareTo(DataWrap o) {
// TODO Auto-generated method stub
return this.data>o.data?1:(this.data==o.data?0:-1);
}
}